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

Implementation and Application of Automata

26th International Conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022, Proceedings

Pascal Caron, Ludovic Mignot (Herausgeber)

Buch | Softcover
X, 251 Seiten
2022 | 1st ed. 2022
Springer International Publishing (Verlag)
978-3-031-07468-4 (ISBN)
CHF 97,35 inkl. MwSt
This book constitutes the proceedings of the 26th International Conference on Implementation and Application of Automata, CIAA 2022, held in Rouen, France in June/ July 2022. The topics of the papers covering various fields in the application, implementation, and theory of automata and related structures.
This book constitutes the proceedings of the 26th International Conference on Implementation and Application of Automata, CIAA 2022, held in Rouen, France in June/ July 2022. The 16 regular papers presented together with 3 invited lectures in this book were carefully reviewed and selected from 26 submissions. The topics of the papers covering various fields in the application, implementation, and theory of automata and related structures.

On 25 Years of CIAA Through the Lens of Data Science.- Manipulation of Regular Expressions Using Derivatives: an Overview.- How to Settle the ReDoS Problem: Back to the Classical Automata Theory.- Ordered Context-Free Grammars.- Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription.- A Similarity Measure for Formal Languages Based on Convergent Geometric Series.- Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata.- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's.- A Toolkit for Parikh Matrices.- Syntax Checking Either Way.- On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata.- The Cut Operation in Subclasses of Convex Languages (Extended Abstract).- Variations of the Separating Words Problem.- Homomorphisms on graph-walking automata.- Nondeterministic State Complexity of Site-Directed Deletion.- Energy Complexity of Regular Language Recognition.-Real-Time, Constant-Space, Constant-Randomness Verifiers.- Constrained Synchronization for Monotonic, Solvable and Automata with Simple Idempotents.- An Ambiguity Hierarchy of Weighted Context-free Grammars.

Erscheinungsdatum
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo X, 251 p. 62 illus., 17 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 409 g
Themenwelt Mathematik / Informatik Informatik Datenbanken
Mathematik / Informatik Informatik Software Entwicklung
Informatik Theorie / Studium Künstliche Intelligenz / Robotik
Schlagworte Artificial Intelligence • Automata • Automata Theory • Automation • Bioinformatics • Compilers • Complexity of automata operations • Computational Linguistics • Computer-Aided Verification • Computer Science • Computer systems • Concurrency • context free languages • Databases • Engineering • Finite Automata • Formal Languages • Linguistics • Mathematics • Natural Language Processing (NLP) • Natural Languages • Query Languages • regular languages • theoretical computer science • translation (languages)
ISBN-10 3-031-07468-8 / 3031074688
ISBN-13 978-3-031-07468-4 / 9783031074684
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
von absurd bis tödlich: Die Tücken der künstlichen Intelligenz

von Katharina Zweig

Buch | Softcover (2023)
Heyne (Verlag)
CHF 27,95