- Eugene Asarin, Aldric Degorre, Catalin Dima and Bernardo Jacobo Inclán: Computing the Bandwidth of Meager Timed Automata
- Aaron Barnoff, Curtis Bright and Jeffrey Shallit: Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
- Robert Baumgartner and Sicco Verwer: PDFA distillation with error bound guarantees
- Martin Berglund, Willeke Martens and Brink van der Merwe: Constructing a BPE Tokenization DFA
- Yohan Boichut, Adrien Boiret and Vincent Hugot: SAT-Based Automated Completion for Reachability Analysis
- Bernard Boigelot, Pascal Fontaine and Baptiste Vergain: Non-Emptiness Test for Automata over Words Indexed by the Reals and Rationals
- Simon Dieck and Sicco Verwer: On bidirectional deterministic finite automata
- Guilherme Duarte, Nelma Moreira, Luca Prigioniero and Rogério Reis: Block Languages and their Bitmap Representations
- Attila Egri-Nagy and Chrystopher Nehaniv: From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
- Hermann Gruber, Markus Holzer and Christian Rauch: On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
- Luisa Herrmann and Richard Mörbitz: Global One-Counter Tree Automata
- Michal Hospodár, Viktor Olejár and Juraj Šebej: Decision Problems for Subregular Classes
- Jozef Jirásek, Galina Jirásková and Jeffrey Shallit: State Complexity of the Minimal Star Basis
- Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci and Matthias Wendlandt: On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
- Sebastian Maneth and Viet Anh Martin Vu: Attributed Tree Transducers for Partial Functions
- Antoine Martin, Alexandre Duret-Lutz and Etienne Renault: Translation of Semi-Extended Regular Expressions using Derivatives
- Olga Martynova: Exact descriptional complexity of determinization of input-driven pushdown automata
- Keisuke Nakano and Munehiro Iwami: Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata
- Dirk Nowotka and Max Wiedenhöft: The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
- Giovanni Pighizzini: Push Complexity: Optimal Bounds and Unary Inputs
- Maria Radionova and Alexander Okhotin: Decision problems for reversible and permutation automata
- Alexander Roodt, Brendan Watling, Willem Bester, Brink van der Merwe, Sicheol Sung and Yo-Sub Han: Benchmarking Regular Expression Matching
- Tang Tianxiang and Vladimir Zakharov: On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers
- Takao Yuyama and Ryoma Sin’Ya: Measuring Power of Commutative Group Languages
28th International Conference on Implementation and Application of Automata