| 2021 | Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers. Diana Geneva, Georgi Shopov, Stoyan Mihov |
| 2021 | Ambiguity Hierarchies for Weighted Tree Automata. Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht |
| 2021 | Approximate Hashing for Bioinformatics. Guy Arbitman, Shmuel T. Klein, Pierre Peterlongo, Dana Shapira |
| 2021 | Back to the Future: A Fresh Look at Linear Temporal Logic. Javier Esparza |
| 2021 | Boolean Kernels of Context-Free Languages. Martin Kutrib, Luca Prigioniero |
| 2021 | Degrees of Restriction for Two-Dimensional Automata. Taylor J. Smith, Kai Salomaa |
| 2021 | Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis. Su-Hyeon Kim, Hyeonseung Im, Sang-Ki Ko |
| 2021 | Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton. Simone Faro, Stefano Scafiti |
| 2021 | Guessing the Buffer Bound for k-Synchronizability. Cinzia Di Giusto, Laetitia Laversa, Étienne Lozes |
| 2021 | Implementation and Application of Automata - 25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings Sebastian Maneth |
| 2021 | Memoized Regular Expressions. Brink van der Merwe, Jacobie Mouton, Steyn van Litsenborgh, Martin Berglund |
| 2021 | Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. Stefan Hoffmann |
| 2021 | Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs. Jeffrey O. Shallit |
| 2021 | State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints. Stefan Hoffmann |
| 2021 | The Commutative Closure of Shuffle Languages over Group Languages is Regular. Stefan Hoffmann |
| 2021 | The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract). Markus Holzer, Christian Rauch |