Zum Hauptinhalt springen
Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Implementation and Application of Automata -

Implementation and Application of Automata

29th International Conference, CIAA 2025, Palermo, Italy, September 22–25, 2025, Proceedings
Buch | Softcover
XX, 332 Seiten
2025
Springer International Publishing (Verlag)
9783032026019 (ISBN)
CHF 98,85 inkl. MwSt

This book constitutes the proceedings of the 29th International Conference on Implementation and Application of Automata, CIAA 2025, held in Palermo, Italy, during September 22 25, 2025.

The 22 full papers presented in this volume were carefully reviewed and selected from 32 submissions. 

They focus on all aspects on the field of automata theory and implementation, and theory of automata and related structures.

.- Complementable Normal Form of Parametrized Automata.

.- Toward the Glushkovization of Automata: the Strong Stabilization.

.- Constructing Compact BPE Token DFAs.

.- Epsilon Automata on Linear Orderings.

.- Multi-entry DFA with reduced initial states to speedup parallel recognition.

.- Two-Way Automata and Bounded Languages.

.- An Algebraic Approach to the Equivalence Checking of Deterministic Top-down Tree Transducers.

.- An active learning algorithm for bidirectional deterministic finite automata.

.- Dynamically Weighted Tree Transducers.

.- Engineering an LTLf Synthesis Tool.

.- Subsequence Matching and Analysis Problems for Automata with Translucent Letters.

.- Shape Preserving Tree Transducers.

.- Simulating two-way nondeterministic finite automata over small alphabets by one-way nondeterministic automata.

.- A New Approach for Showing Termination of Parameterized Transition Systems.

.- An Earley-Based Universal Error-Correcting Parser.

.- More on Language Families with a Decidable Pumping-Problem (Extended Abstract).

.- Self-Verifying Predicates in B¨uchi Arithmetic.

.- State-Freezing Pushdown Automata.

.- From regular expressions to deterministic finite automata: $2 {frac{n}{2}+sqrt{n}(log n) {Theta(1)}}$ states are necessary and sufficient.

.- A first taste of MeSCaL, a tool for solving membership problems for regular languages.

.- In orbit with MeSCaL: higher in concatenation and navigational hierarchies of regular languages.

.- A hierarchy of reversible finite automata.

Erscheinungsdatum
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo XX, 332 p. 53 illus., 17 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Schlagworte Compilers • Complexity of automata operations • Computer-Aided Verification • Concurrency • Data and Image Compression • Data structure design for automata • Design and architecture of automata software • Digital Libraries • DNA/molecular/membrane computing • Document Engineering • Editors, environments • Experimental studies and practical experiences • Industrial Applications • Natural Language Processing • Networking • New algorithms for manipulating automata • object-oriented modeling • Pattern-Matching • Quantum Computing • speech and speaker recognition
ISBN-13 9783032026019 / 9783032026019
Zustand Neuware
Informationen gemäß Produktsicherheitsverordnung (GPSR)
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 53,15
Teil 2 der gestreckten Abschlussprüfung Fachinformatiker/-in …

von Dirk Hardy; Annette Schellenberg; Achim Stiefel

Buch | Softcover (2025)
Europa-Lehrmittel (Verlag)
CHF 37,90