Buch, Englisch, Band 16695, 217 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 371 g
30th International Conference, CIAA 2026, Kingston, ON, Canada, August 5-8, 2026, Proceedings
Buch, Englisch, Band 16695, 217 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 371 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-032-31176-4
Verlag: Springer
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Information Retrieval
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Data Warehouse
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
Weitere Infos & Material
.- 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.
