Robert Ferens and Marek Szykuła. Complexity of Regular Bifix-Free Languages
Janusz Brzozowski and Corwin Sinnamon.
Complexity of Proper Prefix-Convex Regular Languages
Andrew Ryzhikov.
Synchronization Problems in Automata without Non-trivial Cycles
Claudia Cauli and Nir Piterman.
Equivalence of Probabilistic μ-calculus and p-Automata
Antonis Achilleos, Luca Aceto, Anna Ingolfsdottir, Adrian Francalanza and Saevar Orn Kjartansson.
On the Complexity of Determinizing Monitors
Henrik Björklund, Johanna Björklund and Petter Ericson.
On the Regularity and Learnability of Ordered DAG Languages
Stefan Gerdjikov, Stoyan Mihov and Klaus Schulz.
A simple method for building bimachines from functional finite-state transducers
Paolo Massazza.
On the conjecture $L_{DFCM}\subset RCM$
Marek Szykuła and John Wittnebel.
Syntactic Complexity of Bifix-Free Languages
Michal Hospodár, Galina Jirásková and Peter Mlynárčik.
Nondeterministic Complexity of Operations on Free and Convex Languages
Henning Fernau, Lakshmanan Kuppusamy and Indhumathi Raman.
Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems
Yo-Sub Han and Sang-Ki Ko.
Alignment Distance of Regular Tree Languages
Sylvain Lombardy and Louis-Marie Dando.
From Hadamard Expressions to Weighted Rotating Automata and Back
Martin Kutrib, Andreas Malcher and Matthias Wendlandt.
Transducing Reversibly with Finite State Machines
Martin Berglund, Brink van der Merwe, Bruce Watson and Nicolaas Weideman.
On the Semantics of Atomic Subgroups in Practical Regular Expressions
Henning Bordihn and Markus Holzer.
On the Number of Active States in Deterministic and Nondeterministic Finite Automata
Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi and Denis Kuperberg.
Stamina: Stabilisation Monoids IN Automata theory