Skip to main content
SpringerLink
Log in

Implementation and Application of Automata

25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings

  • Conference proceedings
  • © 2021

Overview

Editors:
  1. Sebastian Maneth

    1. University of Bremen, Bremen, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12803)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CIAA 2021.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (15 papers)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  3. Technical Contributions

    1. Front Matter

      Pages 25-25
      Download chapter 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
    Download chapter PDF
Back to top

Other volumes

  1. Implementation and Application of Automata

Keywords

About this book

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.

Editors and Affiliations

  • University of Bremen, Bremen, Germany

    Sebastian Maneth

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation