東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Descriptional complexity of formal s...

Shallit, Jeffrey.

FindBook

Google Book

Amazon

博客來

Descriptional complexity of formal systems = 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015 : proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Descriptional complexity of formal systems/ edited by Jeffrey Shallit, Alexander Okhotin.
其他題名:	17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015 : proceedings /
其他題名:	DCFS 2015
其他作者:	Shallit, Jeffrey.
出版者:	Cham :Springer International Publishing : : 2015.,
面頁冊數:	xii, 293 p. :ill., digital ;24 cm.
內容註:	Invited Talks -- Regular Functions -- Unambiguity in Automata Theory -- Contributed Papers -- Partial Derivative Automaton for Regular Expressions with Shue -- Upper Bound on Syntactic Complexity of Suffix-Free Languages -- Nondeterministic Tree Width of Regular Languages -- Integer Complexity: Experimental and Analytical Results II -- Square on ideal, closed and free languages -- A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0,2] -- Compressibility of finite languages by grammars -- On the Complexity and Decidability of Some Problems Involving Shue -- On the Computational Complexity of Problems Related to Distinguishability Sets -- Prefix-Free Subsets of Regular Languages and Descriptional Complexity -- Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems -- On Simulation Costs of Unary Limited Automata -- On some decision problems for stateless deterministic ordered restarting Automata -- Quantum queries on permutations -- Complement on Free and Ideal Languages -- Universal Disjunctive Concatenation and Star -- Quasi-Distances and Weighted Finite Automata -- The State Complexity of Permutations on Finite Languages Over Binary Alphabets -- Star-Complement-Star on Prefix-Free Languages -- Groups whose word problem is a Petri net language -- Regular realizability problems and context-free languages -- Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton -- Quantum State Complexity of Formal Languages.
Contained By:	Springer eBooks
標題:	Formal methods (Computer science) -
電子資源:	http://dx.doi.org/10.1007/978-3-319-19225-3
ISBN:	9783319192253 (electronic bk.)

Descriptional complexity of formal systems = 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015 : proceedings /
Descriptional complexity of formal systems17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015 : proceedings /[electronic resource] :DCFS 2015edited by Jeffrey Shallit, Alexander Okhotin. - Cham :Springer International Publishing :2015. - xii, 293 p. :ill., digital ;24 cm. - Lecture notes in computer science,91180302-9743 ;. - Lecture notes in computer science ;5353..

Invited Talks -- Regular Functions -- Unambiguity in Automata Theory -- Contributed Papers -- Partial Derivative Automaton for Regular Expressions with Shue -- Upper Bound on Syntactic Complexity of Suffix-Free Languages -- Nondeterministic Tree Width of Regular Languages -- Integer Complexity: Experimental and Analytical Results II -- Square on ideal, closed and free languages -- A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0,2] -- Compressibility of finite languages by grammars -- On the Complexity and Decidability of Some Problems Involving Shue -- On the Computational Complexity of Problems Related to Distinguishability Sets -- Prefix-Free Subsets of Regular Languages and Descriptional Complexity -- Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems -- On Simulation Costs of Unary Limited Automata -- On some decision problems for stateless deterministic ordered restarting Automata -- Quantum queries on permutations -- Complement on Free and Ideal Languages -- Universal Disjunctive Concatenation and Star -- Quasi-Distances and Weighted Finite Automata -- The State Complexity of Permutations on Finite Languages Over Binary Alphabets -- Star-Complement-Star on Prefix-Free Languages -- Groups whose word problem is a Petri net language -- Regular realizability problems and context-free languages -- Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton -- Quantum State Complexity of Formal Languages.

ISBN: 9783319192253 (electronic bk.)

Standard No.: 10.1007/978-3-319-19225-3doiSubjects--Topical Terms:

882407
Formal methods (Computer science)

LC Class. No.: QA76.9.F67

Dewey Class. No.: 004.0151

Descriptional complexity of formal systems = 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015 : proceedings /
LDR:02670nam a2200325 a 4500 001 2007542
003 DE-He213
005 20160120101008.0
006 m d
007 cr nn 008maaau
008 160219s2015 gw s 0 eng d
020 $a 9783319192253 (electronic bk.)
020 $a 9783319192246 (paper)
024 7 $a 10.1007/978-3-319-19225-3 $2 doi
035 $a 978-3-319-19225-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.F67
072 7 $a UYZG $2 bicssc
072 7 $a COM037000 $2 bisacsh
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.F67 $b D277 2015
245 1 0 $a Descriptional complexity of formal systems $h [electronic resource] : $b 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015 : proceedings / $c edited by Jeffrey Shallit, Alexander Okhotin.
246 3 $a DCFS 2015
260 $a Cham : $c 2015. $b Springer International Publishing : $b Imprint: Springer,
300 $a xii, 293 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9118
505 0 $a Invited Talks -- Regular Functions -- Unambiguity in Automata Theory -- Contributed Papers -- Partial Derivative Automaton for Regular Expressions with Shue -- Upper Bound on Syntactic Complexity of Suffix-Free Languages -- Nondeterministic Tree Width of Regular Languages -- Integer Complexity: Experimental and Analytical Results II -- Square on ideal, closed and free languages -- A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0,2] -- Compressibility of finite languages by grammars -- On the Complexity and Decidability of Some Problems Involving Shue -- On the Computational Complexity of Problems Related to Distinguishability Sets -- Prefix-Free Subsets of Regular Languages and Descriptional Complexity -- Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems -- On Simulation Costs of Unary Limited Automata -- On some decision problems for stateless deterministic ordered restarting Automata -- Quantum queries on permutations -- Complement on Free and Ideal Languages -- Universal Disjunctive Concatenation and Star -- Quasi-Distances and Weighted Finite Automata -- The State Complexity of Permutations on Finite Languages Over Binary Alphabets -- Star-Complement-Star on Prefix-Free Languages -- Groups whose word problem is a Petri net language -- Regular realizability problems and context-free languages -- Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton -- Quantum State Complexity of Formal Languages.
650 0 $a Formal methods (Computer science) $3 882407
650 0 $a Formal languages $3 703979
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Computation by Abstract Devices. $3 891207
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
650 2 4 $a Logics and Meanings of Programs. $3 892495
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
700 1 $a Shallit, Jeffrey. $3 1899282
700 1 $a Okhotin, Alexander. $3 1937414
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 5353. $x 0302-9743 $3 1274248
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-19225-3
950 $a Computer Science (Springer-11645)