Implementation and application of automata : 25th international conference, CIAA 2021, virtual event, July 19-22, 2021 : proceedings / Sebastian Maneth (ed.).
CIAA (Conference) (25th : 2021 : Online); Maneth, Sebastian, editor.
2021
QA267 .C53 2021
Available Online

Linked e-resources

Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks

Details

Title
Implementation and application of automata : 25th international conference, CIAA 2021, virtual event, July 19-22, 2021 : proceedings / Sebastian Maneth (ed.).
Meeting Name
CIAA (Conference) (25th : 2021 : Online)
ISBN
9783030791216 (electronic bk.)
3030791211 (electronic bk.)
9783030791209
3030791203
DOI
https://doi.org/10.1007/978-3-030-79121-6
Published
Cham : Springer, [2021]
Copyright
©2021
Language
English
Description
1 online resource : illustrations (some color)
Item Number
10.1007/978-3-030-79121-6 doi
Call Number
QA267 .C53 2021
Dewey Decimal Classification
006.3
Summary
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.
Note
International conference proceedings.
Includes author index.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed July 1, 2021).
Added Author
Maneth, Sebastian, editor.
Series
Lecture notes in computer science ; 12803.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
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.

Browse Subjects

Show more subjects...

Statistics

from
to
Export