| 2021 | Learning Mealy Machines with One Timer. | Frits W. Vaandrager, Roderick Bloem, Masoud Ebrahimi |
| 2021 | Tree-Like Unit Refutations in Horn Constraint Systems. | K. Subramani, Piotr Wojciechowski |
| 2021 | An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs. | Bastien Sre, Log Jezequel, Didier Lime |
| 2021 | Usefulness of Information and Unary Languages. | Giovanni Pighizzini, Branislav Rovan, Simon Sdovsk |
| 2021 | On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata. | Semyon Petrov, Alexander Okhotin |
| 2021 | Optimising Attractor Computation in Boolean Automata Networks. | Kvin Perrot, Pacme Perrotin, Sylvain Sen |
| 2021 | Cadences in Grammar-Compressed Strings. | Julian Pape-Lange |
| 2021 | On Hardest Languages for One-Dimensional Cellular Automata. | Mikhail Mrykhin, Alexander Okhotin |
| 2021 | On the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits. | Hiroki Morizumi |
| 2021 | Context-Free Grammars with Lookahead. | Takayuki Miyazaki, Yasuhiko Minamide |
| 2021 | Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete. | Aaron Lye |
| 2021 | On the Computational Power of Programs over BA | Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan |
| 2021 | Commutative Rational Term Rewriting. | Mamoru Ishizuka, Takahito Aoto, Munehiro Iwami |
| 2021 | State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets. | Stefan Hoffmann |
| 2021 | Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. | Stefan Hoffmann |
| 2021 | Temporal Logics with Language Parameters. | Jens Oliver Gutsfeld, Markus Mller-Olm, Christian Dielitz |
| 2021 | Partially Directed Animals with a Bounded Number of Holes. | Valentina Dorigatti, Paolo Massazza |
| 2021 | Sequentiality of Group-Weighted Tree Automata. | Frederic Drband, Thomas Feller, Kevin Stier |
| 2021 | Approximated Determinisation of Weighted Tree Automata. | Frederic Drband, Thomas Feller, Kevin Stier |
| 2021 | On Balanced Sequences and Their Asymptotic Critical Exponent. | Francesco Dolce, L'ubomra Dvorkov, Edita Pelantov |
| 2021 | Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding. | Stefano Crespi-Reghizzi, Pierluigi San Pietro |
| 2021 | Succinct Representations for (Non)Deterministic Finite Automata. | Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2021 | Location Based Automata for Expressions with Shuffle. | Sabine Broda, Antnio Machiavelo, Nelma Moreira, Rogrio Reis |
| 2021 | Finite-Word Hyperlanguages. | Borzoo Bonakdarpour, Sarai Sheinvald |
| 2021 | On Language Varieties Without Boolean Operations. | Fabian Birkmann, Stefan Milius, Henning Urbat |