| 2021 | State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters. | Stefan Hoffmann |
| 2021 | Deciding FO | Viktor Henriksson, Manfred Kufleitner |
| 2021 | Integer Weighted Automata on Infinite Words. | Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov |
| 2021 | Two-Way Non-uniform Finite Automata. | Fabian Frei, Juraj Hromkovic, Richard Krlovic, Rastislav Krlovic |
| 2021 | Parsimonious Computational Completeness. | Henning Fernau |
| 2021 | Weighted Prefix Normal Words: Mind the Gap. | Yannik Eikmeier, Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka |
| 2021 | Balanced-By-Construction Regular and mega-Regular Languages. | Luc Edixhoven, Sung-Shik Jongmans |
| 2021 | Properties of Graphs Specified by a Regular Language. | Volker Diekert, Henning Fernau, Petra Wolf |
| 2021 | Reducing Local Alphabet Size in Recognizable Picture Languages. | Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro |
| 2021 | Variations on the Post Correspondence Problem for Free Groups. | Laura Ciobanu, Alan D. Logan |
| 2021 | Extremal Binary PFAs in a Čern Family. | Stijn Cambie, Michiel de Bondt, Henk Don |
| 2021 | Compositions of Constant Weighted Extended Tree Transducers. | Malte Blattmann, Andreas Maletti |
| 2021 | Active Learning of Sequential Transducers with Side Information About the Domain. | Raphal Berthon, Adrien Boiret, Guillermo A. Prez, Jean-Franois Raskin |
| 2021 | A Strong Non-overlapping Dyck Code. | Elena Barcucci, Antonio Bernini, Renzo Pinzani |
| 2021 | Morphic Sequences Versus Automatic Sequences. | Jean-Paul Allouche |
| 2020 | Context-Freeness of Word-MIX Languages. | Ryoma Sin'ya |
| 2020 | Transition Property for α-Power Free Languages with $\alpha \ge 2$ and $k\ge 3$ Letters. | Josef Rukavicka |
| 2020 | Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract). | Eric Rowland, Manon Stipulanti |
| 2020 | Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices. | Daniel Prusa, Michael Wehar |
| 2020 | On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection. | Mateus de Oliveira Oliveira, Michael Wehar |
| 2020 | Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata. | Augusto Modanese |
| 2020 | On Tree Substitution Grammars. | Andreas Maletti, Kevin Stier |
| 2020 | On the Balancedness of Tree-to-Word Transducers. | Raphaela Lbel, Michael Luttenberger, Helmut Seidl |
| 2020 | Equivalence of Linear Tree Transducers with Output in the Free Group. | Raphaela Lbel, Michael Luttenberger, Helmut Seidl |
| 2020 | Avoidability of Additive Cubes over Alphabets of Four Numbers. | Florian Lietard, Matthieu Rosenfeld |