- Almagor, Yizhaq: Jumping Automata over Infinite Words
- Anselmo, Castiglione, Flores, Giammarresi, Madonia, Mantaci: Isometric Words based on Swap, Mismatch Distance
- Banerjee, Chatterjee, Guha: Set Augmented Finite Automata over Infinite Alphabets
- Béal, Crochemore: Fast detection of specific fragments against a set of sequences
- Cheon, Han: Weak inverse neighborhood of languages
- de Menibus, Lutfalla, Noûs: The Domino problem is undecidable on every rhombus subshift
- Durand, Caron, Patrou: The exact state complexity for the composition of Root, reversal
- Giuliani, Inenaga, Liptak, Romana, Sciortino, Urbina: Bit catastrophes for the Burrows-Wheeler Transform
- Hoffmann: Completely Distinguishable Automata, the Set of Synchronizing Words
- Hoffmann: Synchronization of Parikh Automata
- Hugenroth: Zielonka DAG Acceptance, Regular Languages over Infinite Words
- Kenkireth, Malhotra: On Word Representable, Multi-Word Representable Graphs
- Kim, Han, Ko, Salomaa: On the Simon’s Congruence Neighborhood of Languages
- Kutrib, Meyer: Tree-Walking-Storage Automata
- Masakova, Pelantova, Studeničová: Rewriting rules for arithmetics in alternate base systems
- Ruszil: Synchronizing Automata with Coinciding Cycles
- Shur: Approaching Repetition Thresholds Via Local Resampling, Entropy Compression
- Thompson, Freydenberger: Languages Generated by Conjunctive Query Fragments of FC[REG]
- Yuyama: Groups whose word problem is accepted by an abelian G-automaton