| 2021 | A Linear-Time Simulation of Deterministic d-Limited Automata. Alexander A. Rubtsov |
| 2021 | A Strong Non-overlapping Dyck Code. Elena Barcucci, Antonio Bernini, Renzo Pinzani |
| 2021 | Active Learning of Sequential Transducers with Side Information About the Domain. Raphaël Berthon, Adrien Boiret, Guillermo A. Pérez, Jean-François Raskin |
| 2021 | Balanced-By-Construction Regular and ømega-Regular Languages. Luc Edixhoven, Sung-Shik Jongmans |
| 2021 | Bounded Languages Described by GF(2)-grammars. Vladislav Makarov |
| 2021 | Branching Frequency and Markov Entropy of Repetition-Free Languages. Elena A. Petrova, Arseny M. Shur |
| 2021 | Carathéodory Extensions of Subclasses of Regular Languages. Ryoma Sin'ya |
| 2021 | Compositions of Constant Weighted Extended Tree Transducers. Malte Blattmann, Andreas Maletti |
| 2021 | Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata. Stefan Hoffmann |
| 2021 | Deciding FO Viktor Henriksson, Manfred Kufleitner |
| 2021 | Definability Results for Top-Down Tree Transducers. Sebastian Maneth, Helmut Seidl, Martin Vu |
| 2021 | Developments in Language Theory - 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021, Proceedings Nelma Moreira, Rogério Reis |
| 2021 | Extremal Binary PFAs in a Černý Family. Stijn Cambie, Michiel de Bondt, Henk Don |
| 2021 | Integer Weighted Automata on Infinite Words. Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov |
| 2021 | Lyndon Words Formalized in Isabelle/HOL. Stepan Holub, Stepán Starosta |
| 2021 | Morphic Sequences Versus Automatic Sequences. Jean-Paul Allouche |
| 2021 | Parikh Word Representable Graphs and Morphisms. Nobin Thomas, Lisa Mathew, Somnath Bera, Atulya K. Nagar, K. G. Subramanian |
| 2021 | Parsimonious Computational Completeness. Henning Fernau |
| 2021 | Pointlike Sets and Separation: A Personal Perspective. Benjamin Steinberg |
| 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 | Reversible Top-Down Syntax Analysis. Martin Kutrib, Uwe Meyer |
| 2021 | Second-Order Finite Automata: Expressive Power and Simple Proofs Using Automatic Structures. Dietrich Kuske |
| 2021 | State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters. Stefan Hoffmann |
| 2021 | Symmetry Groups of Infinite Words. Sergey Luchinin, Svetlana Puzynina |
| 2021 | The Hardest LL(k) Language. Mikhail Mrykhin, Alexander Okhotin |
| 2021 | The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract). Markus Holzer, Christian Rauch |
| 2021 | Two-Way Non-uniform Finite Automata. Fabian Frei, Juraj Hromkovic, Richard Královic, Rastislav Královic |
| 2021 | Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings. Julian Pape-Lange |
| 2021 | Variations on the Post Correspondence Problem for Free Groups. Laura Ciobanu, Alan D. Logan |
| 2021 | Weighted Prefix Normal Words: Mind the Gap. Yannik Eikmeier, Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka |