Buch, Englisch, 304 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 482 g
27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023, Proceedings
Buch, Englisch, 304 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 482 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-031-40246-3
Verlag: Springer Nature Switzerland
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
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.
