Implementation and Application of Automata
25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings
Sebastian Maneth (Redaktør)
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. Les mer
- Vår pris
- 760,-
(Paperback)
Fri frakt!
Leveringstid:
Sendes innen 21 dager
Paperback
Legg i
Paperback
Legg i
Vår pris:
760,-
(Paperback)
Fri frakt!
Leveringstid:
Sendes innen 21 dager
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.
- FAKTA
-
Utgitt:
2021
Forlag: Springer Nature Switzerland AG
Innbinding: Paperback
Språk: Engelsk
Sider: 191
ISBN: 9783030791209
Format: 24 x 16 cm
- KATEGORIER:
- VURDERING
-
Gi vurdering
Les vurderinger
Polyregular Functions.- Back to the Future: A Fresh Look at Linear Temporal Logic.- Say No to Case Analysis: Automating the
Drudgery of Case-Based Proofs 15 Jeffrey Shallit Technical Contributions Regularity Conditions for Iterated Shuffle on Commutative
Regular Languages.- Memoized Regular Expressions.- The Commutative Closure of Shuffle Languages over Group Languages is Regular.-
Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis.- Degrees of Restriction for Two-Dimensional
Automata.- The Range of State Complexities of Languages Resulting from the Cascade Product-The Unary Case (Extended Abstract)
.- Guessing the Buffer Bound for k-Synchronizability.- The Commutative Closure of Shuffle Languages over Group Languages is
Regular.- Organization IX Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers.- Ambiguity Hierarchies
for Weighted Tree Automata.- Boolean Kernels of Context-Free Languages.- Efficient String Matching Based on a Two-Step Simulation
of the Suffix Automaton.- Approximate Hashing for Bioinformatics.