Del 13266 - Lecture Notes in Computer Science

Implementation and Application of Automata

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

Häftad, Engelska, 2022

929 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2022-05-28
Mått155 x 235 x 15 mm
Vikt406 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor251
FörlagSpringer International Publishing AG
ISBN9783031074684

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT
Artificiell intelligens inom Data och IT
Databaser inom Data och IT

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.