1 option
Implementation and Application of Automata : 30th International Conference, CIAA 2026, Kingston, ON, Canada, August 5–8, 2026, Proceedings / edited by Taylor J. Smith.
Springer Nature - Springer Computer Science eBooks 2026 English International Available online
View online- Format:
- Book
- Author/Creator:
- Smith, Taylor J.
- Series:
- Lecture Notes in Computer Science, 1611-3349 ; 16695
- Language:
- English
- Subjects (All):
- Computer science.
- Artificial intelligence.
- Information storage and retrieval systems.
- Algorithms.
- Computer science--Mathematics.
- Discrete mathematics.
- Computer Science Logic and Foundations of Programming.
- Artificial Intelligence.
- Information Storage and Retrieval.
- Discrete Mathematics in Computer Science.
- Theory of Computation.
- Local Subjects:
- Computer Science Logic and Foundations of Programming.
- Artificial Intelligence.
- Information Storage and Retrieval.
- Algorithms.
- Discrete Mathematics in Computer Science.
- Theory of Computation.
- Physical Description:
- 1 online resource (474 pages)
- Edition:
- 1st ed. 2026.
- Place of Publication:
- Cham : Springer Nature Switzerland : Imprint: Springer, 2026.
- Summary:
- This book constitutes the refereed proceedings of the 30th International Conference on Implementation and Application of Automata, CIAA 2026, held in Kingston, ON, Canada, during August 5–8, 2026. The 14 full papers included in this volume were carefully reviewed and selected from 34 submissions. The CIAA 2026 proceedings deal with all aspects of application, implementation, and theory of automata and related structures.
- Contents:
- CONTRIBUTED PAPERS :
- Efficiently Testing Emptiness of Automata on Linear Orderings.
- Boolean Products of Languages.
- Bandwidth of nondeterministic finite automata.
- The Stanat-Weiss Pumping Lemma, Revisited (Extended Abstract).
- Decidability of Regularity for Families of Languages.
- Impartial Derivation Games on Context-Free Grammars.
- Decomposing regular languages under shuffle along trajectories.
- Pattern matching under R-congruence.
- Hyper-Minimization for Deterministic Register Automata.
- On the state complexity of two-way reversible finite automata.
- Efficiently Finding Minimal Absent Subsequences in a String.
- Measure Many Quantum Finite Automata on Infinite Words.
- Complexity of Linear Subsequences of k-Automatic Sequences.
- Minimal Deterministic Finite Automata from Alternating and Boolean Automata.
- Notes:
- Print version record.
- ISBN:
- 9783032359674
- OCLC:
- 1612727160
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.