- Franziska Alber and Philipp Rümmer
Complementable Normal Form of Parametrized Automata - Samira Attou, Ludovic Mignot, Clément Miklarz, and Florent Nicart
Toward the Glushkovization of Automata: the Strong Stabilization - Martin Berglund, Anna Jonsson, Willeke Martens, and Brink Van Der Merwe
Constructing Compact BPE Token DFAs - Bernard Boigelot, Thomas Braipson, and Tom Clara
Epsilon Automata on Linear Orderings - Luca Breveglieri, Angelo Borsotti, Stefano Crespi Reghizzi, and Angelo Morzenti
Multi-entry DFA with reduced initial states to speedup parallel recognition - Zhibo Deng, Tianxiang Tang, and Vladimir Zakharov
An Algebraic Approach to the Equivalence Checking of Deterministic Top-down Tree Transducers - Simon Dieck and Sicco Verwer
An active learning algorithm for bidirectional deterministic finite automata - Frank Drewes, Marco Kuhlmann, and Olle Torstensson
Dynamically Weighted Tree Transducers - Alexandre Duret-Lutz, Shufang Zhu, Nir Piterman, Giuseppe De Giacomo, and Moshe Vardi
Engineering an LTLf Synthesis Tool - Szilárd Zsolt Fazekas, Béla Klein, Tore Koß, Florin Manea, Robert Mercaș, and Timo Specht
Subsequence Matching and Analysis Problems for Automata with Translucent Letters - Paul Gallot and Sebastian Maneth
Shape Preserving Tree Transducers - Viliam Geffert and Alexander Okhotin
Simulating two-way nondeterministic finite automata over small alphabets by one-way nondeterministic automata - Roland Herrmann and Philipp Rümmer
A New Approach for Showing Termination of Parameterized Transition Systems - Maurice Herwig, Norbert Hundeshagen, and Martin Lange
An Earley-Based Universal Error-Correcting Parser - Markus Holzer and Christian Rauch
More on Language Families with a Decidable Pumping-Problem (Extended Abstract) - Mazen Khodier, Luke Schaeffer, and Jeffrey Shallit
Self-Verifying Predicates in Büchi Arithmetic - Martin Kutrib, Andreas Malcher , and Priscilla Raucci
State-Freezing Pushdown Automata - Alessandro Clerici Lorenzini, Giovanni Pighizzini, and Luca Prigioniero
Two-Way Automata and Bounded Languages - Olga Martynova and Alexander Okhotin
From regular expressions to deterministic finite automata: \(2^{\frac{n}{2}+\sqrt{n}(\log n)^{\Theta(1)}}\) states are necessary and sufficient - Thomas Place and Marc Zeitoun
29th International Conference on
Implementation and Application of Automata
22-25 September 2025, Palermo, Italy