- Mikhail Barash and Alexander Okhotin : Grammars with two-sided contexts
- Martin Berglund, Frank Drewes and Brink Van Der Merwe : Catastrophic Backtracking in Regular Expression Matching
- Henning Bordihn, Martin Kutrib and Andreas Malcher : Measuring Communication in Parallel Communicating Finite Automata
- Karel Brinda : Languages of lossless seeds
- Janusz Brzozowski and Gareth Davies : Maximally Atomic Languages
- Cezar Campeanu : Simplifying Nondeterministic Finite Cover Automata
- Vincent Carnino and Sylvain Lombardy : On Determinism and Unambiguity of Weighted Two-way Automata
- Kristina Cevorova, Galina Jiraskova, Peter Mlynarcik, Matúš Palmovský and Juraj Sebej : Operations on Automata with All States Final
- Stefano Crespi Reghizzi and Pierluigi San Pietro : Commutative Languages and their Composition by Consensual Methods
- Chen Fei Du and Jeffrey Shallit : Similarity density of the Thue-Morse word with overlap-free infinite binary words
- Shiguang Feng, Claudia Carapelle, Oliver Fernandez Gil and Karin Quaas : On the Expressiveness of TPTL and MTL over omega-Data Words
- Henning Fernau, Rudolf Freund and Markus Holzer : Cooperating Distributed Grammar Systems of Finit e Index Working in Hybrid Modes
- László Hegedűs and Benedek Nagy : Representations of Circular Words
- Markus Holzer and Sebastian Jakobi : More Structural Characterizations of Some Subregular Language Families by Biautomata
- Milka Hutagalung, Martin Lange and Etienne Lozes : Buffered Simulation Games for Büchi Automata
- Szabolcs Iván : Synchronizing weighted automata
- Andreas Maletti : Hyper-minimization for deterministic weighted tree automata
- Ludovic Mignot, Nadia Ouali Sebti and Ziadi Djelloul : k-Position, Follow, Equation, k-C-Continuation Tree Automata Constructions
- Maris Valdats : Boolean circuit complexity of regular languages
- Antti Valmari : A Simple Character String Proof of the “True but Unprovable” Version of Gödel’s First Incompleteness Theorem
- Vojtěch Vorel : Subset Synchronization of Transitive Automata