Abstract is missing.
- Automata and Grammars for Data WordsHiroyuki Seki. 3-16 [doi]
- Computing the Bandwidth of Meager Timed AutomataEugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán. 19-34 [doi]
- Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic IrrationalsAaron Barnoff, Curtis Bright, Jeffrey O. Shallit. 35-50 [doi]
- PDFA Distillation with Error Bound GuaranteesRobert Baumgartner, Sicco Verwer. 51-65 [doi]
- Constructing a BPE Tokenization DFAMartin Berglund, Willeke Martens, Brink van der Merwe. 66-78 [doi]
- SAT-Based Automated Completion for Reachability AnalysisYohan Boichut, Vincent Hugot, Adrien Boiret. 79-93 [doi]
- Non-emptiness Test for Automata over Words Indexed by the Reals and RationalsBernard Boigelot, Pascal Fontaine, Baptiste Vergain. 94-108 [doi]
- On Bidirectional Deterministic Finite AutomataSimon Dieck, Sicco Verwer. 109-123 [doi]
- Block Languages and Their Bitmap RepresentationsGuilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis. 124-137 [doi]
- From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation SemigroupsAttila Egri-Nagy, Chrystopher L. Nehaniv. 138-152 [doi]
- On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)Hermann Gruber, Markus Holzer 0001, Christian Rauch 0001. 153-165 [doi]
- Global One-Counter Tree AutomataLuisa Herrmann 0001, Richard Mörbitz. 166-179 [doi]
- Decision Problems for Subregular ClassesMichal Hospodár, Viktor Olejár, Juraj Sebej. 180-194 [doi]
- State Complexity of the Minimal Star BasisJozef Jirásek 0001, Galina Jirásková, Jeffrey O. Shallit. 195-207 [doi]
- On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input LettersMartin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt. 208-220 [doi]
- Attributed Tree Transducers for Partial FunctionsSebastian Maneth, Martin Vu. 221-233 [doi]
- Translation of Semi-extended Regular Expressions Using DerivativesAntoine Martin, Etienne Renault, Alexandre Duret-Lutz. 234-248 [doi]
- Exact Descriptional Complexity of Determinization of Input-Driven Pushdown AutomataOlga Martynova 0001. 249-260 [doi]
- Disproving Termination of Non-erasing Sole Combinatory Calculus with Tree AutomataKeisuke Nakano 0001, Munehiro Iwami. 261-275 [doi]
- The Equivalence Problem of E-Pattern Languages with Regular Constraints Is UndecidableDirk Nowotka, Max Wiedenhöft. 276-288 [doi]
- Push Complexity: Optimal Bounds and Unary InputsGiovanni Pighizzini. 289-301 [doi]
- Decision Problems for Reversible and Permutation AutomataMaria Radionova, Alexander Okhotin. 302-315 [doi]
- Benchmarking Regular Expression MatchingAlexander Roodt, Brendan Keith Mark Watling, Willem Bester, Brink van der Merwe, Sicheol Sung, Yo-Sub Han. 316-331 [doi]
- On the Complexity of Decision Problems for Parameterized Finite State Synchronous TransducersTianxiang Tang, Vladimir A. Zakharov. 332-346 [doi]
- Measuring Power of Commutative Group LanguagesTakao Yuyama, Ryoma Sin'ya. 347-362 [doi]