Taylor J. Smith
Implementation and Application of Automata
30th International Conference, CIAA 2026, Kingston, ON, Canada, August 5–8, 2026, Proceedings
Paperback Engels 2026 9783032311764Levertijd ± 9 werkdagen
Gratis verzonden
Samenvatting
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.
Specificaties
ISBN13:9783032311764
Taal:Engels
Bindwijze:Paperback
Aantal pagina's:217
Uitgever:Springer Nature Switzerland
Lezersrecensies
Wees de eerste die een lezersrecensie schrijft!
Inhoudsopgave
.- 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.
.- 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.
Rubrieken
- advisering
- algemeen management
- coaching en trainen
- communicatie en media
- economie
- financieel management
- inkoop en logistiek
- internet en social media
- it-management / ict
- juridisch
- leiderschap
- marketing
- mens en maatschappij
- non-profit
- ondernemen
- organisatiekunde
- personal finance
- personeelsmanagement
- persoonlijke effectiviteit
- projectmanagement
- psychologie
- reclame en verkoop
- strategisch management
- verandermanagement
- werk en loopbaan