| 2023 | Zielonka DAG Acceptance and Regular Languages over Infinite Words. | Christopher Hugenroth |
| 2023 | Bit Catastrophes for the Burrows-Wheeler Transform. | Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Liptk, Giuseppe Romana, Marinella Sciortino, Cristian Urbina |
| 2023 | Weak Inverse Neighborhoods of Languages. | Hyunjoon Cheon, Yo-Sub Han |
| 2023 | The Exact State Complexity for the Composition of Root and Reversal. | Pascal Caron, Alexandre Durand, Bruno Patrou |
| 2023 | Fast Detection of Specific Fragments Against a Set of Sequences. | Marie-Pierre Bal, Maxime Crochemore |
| 2023 | Set Augmented Finite Automata over Infinite Alphabets. | Ansuman Banerjee, Kingshuk Chatterjee, Shibashis Guha |
| 2023 | Isometric Words Based on Swap and Mismatch Distance. | Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci |
| 2023 | Jumping Automata over Infinite Words. | Shaull Almagor, Omer Yizhaq |
| 2023 | Completely Distinguishable Automata and the Set of Synchronizing Words. | Stefan Hoffmann |
| 2023 | Synchronization of Parikh Automata. | Stefan Hoffmann |
| 2022 | Kolmogorov Complexity Descriptions of the Exquisite Behaviors of Advised Deterministic Pushdown Automata. | Tomoyuki Yamakami |
| 2022 | On One-Counter Positive Cones of Free Groups. | Zoran Sunic |
| 2022 | The Power Word Problem in Graph Products. | Florian Stober, Armin Wei |
| 2022 | Measuring Power of Locally Testable Languages. | Ryoma Sin'ya |
| 2022 | Rational Index of Languages with Bounded Dimension of Parse Trees. | Ekaterina N. Shemetova, Alexander Okhotin, Semyon V. Grigorev |
| 2022 | Binomial Complexities and Parikh-Collinear Morphisms. | Michel Rigo, Manon Stipulanti, Markus A. Whiteland |
| 2022 | Performing Regular Operations with 1-Limited Automata. | Giovanni Pighizzini, Luca Prigioniero, Simon Sdovsk |
| 2022 | Weighted Tree Automata with Constraints. | Andreas Maletti, Andreea-Teodora Nsz |
| 2022 | The Billaud Conjecture for ${|{\varSigma } |} = 4$, and Beyond. | Szymon Lopaciuk, Daniel Reidenbach |
| 2022 | Well Quasi-Orders Arising from Finite Ordered Semigroups. | Ondrej Klma, Jonatan Kolegar |
| 2022 | Visit-Bounded Stack Automata. | Jozef Jirsek, Ian McQuillan |
| 2022 | On the Complexity of Decision Problems for Counter Machines with Applications to Coding Theory. | Oscar H. Ibarra, Ian McQuillan |
| 2022 | Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages. | Stefan Hoffmann |
| 2022 | On Perfect Coverings of Two-Dimensional Grids. | Elias Heikkil, Pyry Herva, Jarkko Kari |
| 2022 | Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words. | Andrea Frosini, Ilaria Mancini, Simone Rinaldi, Giuseppe Romana, Marinella Sciortino |