1 option
Implementation and Application of Automata : 25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings / edited by Sebastian Maneth.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12803
- Theoretical Computer Science and General Issues, 2512-2029 ; 12803
- Language:
- English
- Subjects (All):
- Computer science.
- Computer engineering.
- Computer networks.
- Logic programming.
- Theory of Computation.
- Computer Engineering and Networks.
- Logic in AI.
- Local Subjects:
- Theory of Computation.
- Computer Engineering and Networks.
- Logic in AI.
- Physical Description:
- 1 online resource (XIII, 191 pages) : 25 illustrations, 7 illustrations in color.
- Edition:
- 1st ed. 2021.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2021.
- System Details:
- text file PDF
- 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.
- Contents:
- 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
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-79121-6
- 9783030791216
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.