國立高雄大學圖資館 |

登入

回首頁 到查詢結果 [ subject:"Computer Science Logic and Foundations of Programming." ]

Descriptional complexity of formal systems25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Descriptional complexity of formal systemsedited by Henning Bordihn, Nicholas Tran, Gyorgy Vaszil.
其他題名:	25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023 : proceedings /
其他題名:	DCFS 2023
其他作者:	Bordihn, Henning.
團體作者:
出版者:	Cham :Springer Nature Switzerland :2023.
面頁冊數:	xvi, 197 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Formal languagesCongresses.
電子資源:	https://doi.org/10.1007/978-3-031-34326-1
ISBN:	9783031343261$q(electronic bk.)

Descriptional complexity of formal systems25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023 : proceedings /
Descriptional complexity of formal systems25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023 : proceedings /[electronic resource] :DCFS 2023edited by Henning Bordihn, Nicholas Tran, Gyorgy Vaszil. - Cham :Springer Nature Switzerland :2023. - xvi, 197 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,139180302-9743 ;. - Lecture notes in computer science ;4891..

Operational State Complexity Revisited: the Contribution of Monsters and Modifiers -- Hypercubes and Isometric Words based on Swap and Mismatch Distance -- Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle -- Existential and Universal Width of Alternating Finite Automata -- On Jaffe's Pumping Lemma, Revisited -- Operational Complexity: NFA-to-DFA Trade-Off -- The Word Problem for Finitary Automaton Groups -- Separating Words Problem over Groups -- Complexity of Exclusive Nondeterministic Finite Automata -- Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound -- Pushdown and One-Counter Automata: Constant and Non-Constant Memory Usage -- Construction of a Bi-Infinite Power Free Word with a Given Factor and a Non-Recurrent Letter -- Merging two Hierarchies of External Contextual Grammars with Subregular Selection -- A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words.

This book constitutes the proceedings of the 25th International Conference on Descriptional Complexity of Format Systems, DCFS 2023, which took place in Potsdam, Germany, in July 2023. The 14 full papers, including one invited presentation as a full paper, presented in this volume were carefully reviewed and selected from 16 submissions. The conference focus on all aspects of descriptional complexity, including automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.

ISBN: 9783031343261$q(electronic bk.)

Standard No.: 10.1007/978-3-031-34326-1doiSubjects--Topical Terms:

443051
Formal languages
--Congresses.

LC Class. No.: QA267.3 / .D34 2023

Dewey Class. No.: 005.131

Descriptional complexity of formal systems25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023 : proceedings /
LDR:02699nmm a2200349 a 4500 001 656036
003 DE-He213
005 20240319233927.0
006 m d
007 cr nn 008maaau
008 240628s2023 sz s 0 eng d
020 $a 9783031343261$q(electronic bk.)
020 $a 9783031343254$q(paper)
024 7 $a 10.1007/978-3-031-34326-1 $2 doi
035 $a 978-3-031-34326-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.3 $b .D34 2023
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.131 $2 23
090 $a QA267.3 $b .D277 2023
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Descriptional complexity of formal systems $h [electronic resource] : $b 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023 : proceedings / $c edited by Henning Bordihn, Nicholas Tran, Gyorgy Vaszil.
246 3 $a DCFS 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a xvi, 197 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13918
505 0 $a Operational State Complexity Revisited: the Contribution of Monsters and Modifiers -- Hypercubes and Isometric Words based on Swap and Mismatch Distance -- Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle -- Existential and Universal Width of Alternating Finite Automata -- On Jaffe's Pumping Lemma, Revisited -- Operational Complexity: NFA-to-DFA Trade-Off -- The Word Problem for Finitary Automaton Groups -- Separating Words Problem over Groups -- Complexity of Exclusive Nondeterministic Finite Automata -- Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound -- Pushdown and One-Counter Automata: Constant and Non-Constant Memory Usage -- Construction of a Bi-Infinite Power Free Word with a Given Factor and a Non-Recurrent Letter -- Merging two Hierarchies of External Contextual Grammars with Subregular Selection -- A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words.
520 $a This book constitutes the proceedings of the 25th International Conference on Descriptional Complexity of Format Systems, DCFS 2023, which took place in Potsdam, Germany, in July 2023. The 14 full papers, including one invited presentation as a full paper, presented in this volume were carefully reviewed and selected from 16 submissions. The conference focus on all aspects of descriptional complexity, including automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.
650 0 $a Formal languages $v Congresses. $3 443051
650 0 $a Machine theory $v Congresses. $3 442590
650 0 $a Formal methods (Computer science) $3 277520
650 1 4 $a Computer Science Logic and Foundations of Programming. $3 913141
650 2 4 $a Computer Engineering and Networks. $3 913124
650 2 4 $a Artificial Intelligence. $3 212515
700 1 $a Bordihn, Henning. $3 569003
700 1 $a Tran, Nicholas. $3 967183
700 1 $a Vaszil, Gyorgy. $3 933406
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u https://doi.org/10.1007/978-3-031-34326-1
950 $a Computer Science (SpringerNature-11645)