國立高雄大學圖資館 |

Implementation and application of automata27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Implementation and application of automataedited by Benedek Nagy.
其他題名:	27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023 : proceedings /
其他題名:	CIAA 2023
其他作者:	Nagy, Benedek.
團體作者:
出版者:	Cham :Springer Nature Switzerland :2023.
面頁冊數:	xii, 304 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Machine theoryCongresses.
電子資源:	https://doi.org/10.1007/978-3-031-40247-0
ISBN:	9783031402470$q(electronic bk.)

Implementation and application of automata27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023 : proceedings /
Implementation and application of automata27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023 : proceedings /[electronic resource] :CIAA 2023edited by Benedek Nagy. - Cham :Springer Nature Switzerland :2023. - xii, 304 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,141510302-9743 ;. - Lecture notes in computer science ;4891..

Finite automata as verifiers -- Binary Coded Unary Regular Languages -- A Survey on Automata with Translucent Letters -- Earliest Query Answering for Deterministic Stepwise Hedge Automata -- Constrained Multi-Tildes -- On the smallest synchronizing terms of finite tree automata -- Universal First-Order Quantification over Automata -- Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions -- Sweep complexity revisited -- The Pumping Lemma for Regular Languages is Hard -- M-equivalence of Parikh Matrix over a Ternary Alphabet -- Operational Complexity in Subregular Classes -- When Is Context-Freeness Distinguishable from Regularity? An Extension of Parikh's Theorem -- Enhanced Ternary Fibonacci Codes -- Sweeping Input-Driven Pushdown Automata -- Verified Verifying: SMT-LIB for Strings in Isabelle -- Weighted Bottom-up and Top-down Tree Transformations Are Incomparable -- Deciding whether an Attributed Translation can be realized by a Top-Down Transducer -- A time to cast away stones -- Two-way Machines and de Bruijn Words -- Transduction of Automatic Sequences and Applications -- Measuring Power of Generalised Definite Languages -- Smaller Representation of Compiled Regular Expressions.

This book constitutes the proceedings of the 27th International Conference on Implementation and Application of Automata, CIAA 2023, held in Famagusta, North Cyprus, during September 19-22, 2023. The 20 regular papers presented in this book together with invited talks were carefully reviewed and selected from 30 submissions. The topics of the papers cover various fields in the application, implementation, and theory of automata and related structures.

ISBN: 9783031402470$q(electronic bk.)

Standard No.: 10.1007/978-3-031-40247-0doiSubjects--Topical Terms:

442590
Machine theory
--Congresses.

LC Class. No.: QA267 / .C53 2023

Dewey Class. No.: 006.3

Implementation and application of automata27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023 : proceedings /
LDR:02858nmm a2200349 a 4500 001 647473
003 DE-He213
005 20230829134844.0
006 m d
007 cr nn 008maaau
008 240116s2023 sz s 0 eng d
020 $a 9783031402470$q(electronic bk.)
020 $a 9783031402463$q(paper)
024 7 $a 10.1007/978-3-031-40247-0 $2 doi
035 $a 978-3-031-40247-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267 $b .C53 2023
072 7 $a UYA $2 bicssc
072 7 $a COM073000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 006.3 $2 23
090 $a QA267 $b .C565 2023
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Implementation and application of automata $h [electronic resource] : $b 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023 : proceedings / $c edited by Benedek Nagy.
246 3 $a CIAA 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a xii, 304 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 14151
505 0 $a Finite automata as verifiers -- Binary Coded Unary Regular Languages -- A Survey on Automata with Translucent Letters -- Earliest Query Answering for Deterministic Stepwise Hedge Automata -- Constrained Multi-Tildes -- On the smallest synchronizing terms of finite tree automata -- Universal First-Order Quantification over Automata -- Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions -- Sweep complexity revisited -- The Pumping Lemma for Regular Languages is Hard -- M-equivalence of Parikh Matrix over a Ternary Alphabet -- Operational Complexity in Subregular Classes -- When Is Context-Freeness Distinguishable from Regularity? An Extension of Parikh's Theorem -- Enhanced Ternary Fibonacci Codes -- Sweeping Input-Driven Pushdown Automata -- Verified Verifying: SMT-LIB for Strings in Isabelle -- Weighted Bottom-up and Top-down Tree Transformations Are Incomparable -- Deciding whether an Attributed Translation can be realized by a Top-Down Transducer -- A time to cast away stones -- Two-way Machines and de Bruijn Words -- Transduction of Automatic Sequences and Applications -- Measuring Power of Generalised Definite Languages -- Smaller Representation of Compiled Regular Expressions.
520 $a This book constitutes the proceedings of the 27th International Conference on Implementation and Application of Automata, CIAA 2023, held in Famagusta, North Cyprus, during September 19-22, 2023. The 20 regular papers presented in this book together with invited talks were carefully reviewed and selected from 30 submissions. The topics of the papers cover various fields in the application, implementation, and theory of automata and related structures.
650 0 $a Machine theory $v Congresses. $3 442590
650 0 $a Robotics $v Congresses. $3 387162
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Computer Science Logic and Foundations of Programming. $3 913141
650 2 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Information Storage and Retrieval. $3 274190
650 2 4 $a Algorithms. $3 184661
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
700 1 $a Nagy, Benedek. $3 729076
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-40247-0
950 $a Computer Science (SpringerNature-11645)