| 2021 | Learnability and Positive Equivalence Relations. | David R. Blanger, Ziyuan Gao, Sanjay Jain, Wei Li, Frank Stephan |
| 2020 | Complexity of Automatic Sequences. | Hans Zantema |
| 2020 | Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas. | Tomoyuki Yamakami |
| 2020 | Limited Two-Way Deterministic Finite Automata with Advice. | Ahmet Bilal Uan |
| 2020 | Deciding Classes of Regular Languages: The Covering Approach. | Thomas Place |
| 2020 | How to Prove that a Language Is Regular or Star-Free? | Jean-ric Pin |
| 2020 | Cyclic Shift on Multi-component Grammars. | Alexander Okhotin, Alexey Sorokin |
| 2020 | Complete Variable-Length Codes: An Excursion into Word Edit Operations. | Jean Nraud |
| 2020 | Simplified Parsing Expression Derivatives. | Aaron Moss |
| 2020 | Context-Sensitive Fusion Grammars Are Universal. | Aaron Lye |
| 2020 | Pebble-Intervals Automata and FO | Nadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith |
| 2020 | Geometrically Closed Positive Varieties of Star-Free Languages. | Ondrej Klma, Peter Kostolnyi |
| 2020 | Alternating Finite Automata with Limited Universal Branching. | Chris Keeler, Kai Salomaa |
| 2020 | Input Strictly Local Tree Transducers. | Jing Ji, Jeffrey Heinz |
| 2020 | Recompression: Technique for Word Equations and Compressed Data. | Artur Jez |
| 2020 | Approaching Arithmetic Theories with Finite-State Automata. | Christoph Haase |
| 2020 | The Power of Programs over Monoids in J. | Nathan Grosshans |
| 2020 | Windable Heads and Recognizing NL with Constant Randomness. | Mehmet Utkan Gezer |
| 2020 | Ordered Semiautomatic Rings with Applications to Geometry. | Ziyuan Gao, Sanjay Jain, Ji Qi, Philipp Schlicht, Frank Stephan, Jacob Tarr |
| 2020 | On Collapsing Prefix Normal Words. | Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka, Danny Bgsted Poulsen |
| 2020 | The Automatic Baire Property and an Effective Property of mega-Rational Functions. | Olivier Finkel |
| 2020 | Complexity Issues of String to Graph Approximate Matching. | Riccardo Dondi, Giancarlo Mauri, Italo Zoppis |
| 2020 | Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models. | Susanna Donatelli, Serge Haddad |
| 2020 | Reducing the Ambiguity of Parikh Matrices. | Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach |
| 2020 | Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases. | Laure Daviaud |