Implementation and Application of Automata

1. Front Matter

   Pages i-xiii

   PDF

2. Invited Lectures

   1. Front Matter

      Pages 1-1

      PDF

   2. Back to the Future: A Fresh Look at Linear Temporal Logic

      • Javier Esparza

      Pages 3-13

   3. Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs

      • Jeffrey Shallit

      Pages 14-24

3. Technical Contributions

   1. Front Matter

      Pages 25-25

      PDF

   2. Regularity Conditions for Iterated Shuffle on Commutative Regular Languages

      • Stefan Hoffmann

      Pages 27-38

   3. Memoized Regular Expressions

      • Brink van der Merwe, Jacobie Mouton, Steyn van Litsenborgh, Martin Berglund

      Pages 39-52

   4. The Commutative Closure of Shuffle Languages over Group Languages is Regular

      • Stefan Hoffmann

      Pages 53-64

   5. Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis

      • Su-Hyeon Kim, Hyeonseung Im, Sang-Ki Ko

      Pages 65-76

   6. Degrees of Restriction for Two-Dimensional Automata

      • Taylor J. Smith, Kai Salomaa

      Pages 77-89

   7. The Range of State Complexities of Languages Resulting from the Cascade Product—The Unary Case (Extended Abstract)

      • Markus Holzer, Christian Rauch

      Pages 90-101

   8. Guessing the Buffer Bound for k-Synchronizability

      • Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes

      Pages 102-114

   9. State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints

      • Stefan Hoffmann

      Pages 115-126

   10. Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers

       • Diana Geneva, Georgi Shopov, Stoyan Mihov

       Pages 127-139

   11. Ambiguity Hierarchies for Weighted Tree Automata

       • Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht

       Pages 140-151

   12. Boolean Kernels of Context-Free Languages

       • Martin Kutrib, Luca Prigioniero

       Pages 152-164

   13. Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton

       • Simone Faro, Stefano Scafiti

       Pages 165-177

   14. Approximate Hashing for Bioinformatics

       • Guy Arbitman, Shmuel T. Klein, Pierre Peterlongo, Dana Shapira

       Pages 178-189

4. Back Matter

   Pages 191-191

   PDF

This book constitutes the proceedings of the 25th International Conference on Implementation and Application of Automata, CIAA 2021, held in July 2021. Due to Covid-19 pandemic the conference was held virtually. The 13 regular papers presented in this book were carefully reviewed and selected from 20 submissions. The topics of the papers cover various fields in the application, implementation, and theory of automata and related structures.

• artificial intelligence
• automata
• automata theory
• automation
• computational linguistics
• computer science
• computer systems
• context free languages
• databases
• engineering
• finite automata
• formal languages
• linguistics
• mathematics
• numerical model
• probability
• query languages
• regular languages
• theoretical computer science
• translation (languages)

• University of Bremen, Bremen, Germany

  Sebastian Maneth

Policies and ethics