Program

15:00

Registration

Contributed talks

Chair: Sabrina Mantaci

• 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
• Martin Kutrib, Andreas Malcher , and Priscilla Raucci
  State-Freezing Pushdown Automata
• Bernard Boigelot, Thomas Braipson, and Tom Clara
  Epsilon Automata on Linear Orderings
• Maurice Herwig, Norbert Hundeshagen, and Martin Lange
  An Earley-Based Universal Error-Correcting Parser

Invited Talk

Chair: Antonio Restivo

Marie-Pierre Béal
Symbolic Dynamics and Automata

Contributed talks

Chair: Luca Prigioniero

• Paul Gallot and Sebastian Maneth
  Shape Preserving Tree Transducers
• 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
• Zhibo Deng, Tianxiang Tang, and Vladimir Zakharov
  An Algebraic Approach to the Equivalence Checking of Deterministic Top-down Tree Transducers
• Frank Drewes, Marco Kuhlmann, and Olle Torstensson
  Dynamically Weighted Tree Transducers

Contributed talks

Chair: Dora Giammarresi

• Alexandre Duret-Lutz, Shufang Zhu, Nir Piterman, Giuseppe De Giacomo, and Moshe Vardi
  Engineering an LTLf Synthesis Tool
• Thomas Place and Marc Zeitoun
  First steps in MeSCaL: a tool for solving membership problems for regular languages
• Thomas Place and Marc Zeitoun
  In orbit with MeSCaL: higher in concatenation and navigational hierarchies of regular languages

Business Meeting

Invited Talk

Chair: Giuseppa Castiglione

Alberto Policriti
Wheeler Languages and Automata

Contributed talks

Chair: Martin Kutrib

• Luca Breveglieri, Angelo Borsotti, Stefano Crespi Reghizzi, and Angelo Morzenti
  Multi-entry DFA with reduced initial states to speedup parallel recognition
• Markus Holzer and Christian Rauch
  More on Language Families with a Decidable Pumping-Problem (Extended Abstract)
• Roland Herrmann and Philipp Rümmer
  A New Approach for Showing Termination of Parameterized Transition Systems
• Franziska Alber and Philipp Rümmer
  Complementable Normal Form of Parametrized Automata

Social activities

Invited Talk

Chair: Markus Holzer

Dirk Nowotka
On Decision Problems of Pattern Languages

Contributed talks

Chair: Sebastian Maneth

• Maria Radionova and Alexander Okhotin
  A hierarchy of reversible finite automata
• Alessandro Clerici Lorenzini, Giovanni Pighizzini, and Luca Prigioniero
  Two-Way Automata and Bounded Languages
• Viliam Geffert and Alexander Okhotin
  Simulating two-way nondeterministic finite automata over small alphabets by one-way nondeterministic automata
• Simon Dieck and Sicco Verwer
  An active learning algorithm for bidirectional deterministic finite automata

Contributed talks

Chair: Luca Breveglieri

• Martin Berglund, Anna Jonsson, Willeke Martens, and Brink Van Der Merwe
  Constructing Compact BPE Token DFAs
• Mazen Khodier, Luke Schaeffer, and Jeffrey Shallit
  Self-Verifying Predicates in Büchi Arithmetic
• Samira Attou, Ludovic Mignot, Clément Miklarz, and Florent Nicart
  Toward the Glushkovization of Automata: the Strong Stabilization

Farewell Coffe