| 2024 | Deterministic Pushdown Automata with Translucent Input Letters. | Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt |
| 2024 | Cellular Automata: From Black-and-White to High Gloss Color. | Martin Kutrib, Andreas Malcher |
| 2024 | Approximate Cartesian Tree Pattern Matching. | Sungmin Kim, Yo-Sub Han |
| 2024 | Polyregular Functions: Characterisations and Refutations. | Sandra Kiefer |
| 2024 | Semidirect Product Decompositions for Periodic Regular Languages. | Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki |
| 2024 | Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors. | Oscar H. Ibarra, Ian McQuillan |
| 2024 | The Pumping Lemma for Context-Free Languages is Undecidable. | Hermann Gruber, Markus Holzer, Christian Rauch |
| 2024 | How to Find Long Maximal Exact Matches and Ignore Short Ones. | Travis Gagie |
| 2024 | Word Equations, Constraints, and Formal Languages. | Laura Ciobanu |
| 2024 | On the Complexity and Approximability of Bounded Access Lempel Ziv Coding. | Ferdinando Cicalese, Francesca Ugazio |
| 2024 | Cyclic Operator Precedence Grammars for Improved Parallel Parsing. | Michele Chiari, Dino Mandrioli, Matteo Pradella |
| 2024 | O | Marco B. Caminati |
| 2024 | Universal Rewriting Rules for the Parikh Matrix Injectivity Problem. | Ingyu Baek, Joonghyuk Hahn, Yo-Sub Han, Kai Salomaa |
| 2024 | Logic and Languages of Higher-Dimensional Automata. | Amazigh Amrane, Hugo Bazille, Uli Fahrenberg, Marie Fortin |
| 2024 | Deciding Conjugacy of a Rational Relation - (Extended Abstract). | C. Aiswarya, Amaldev Manuel, Saina Sunny |
| 2023 | Groups Whose Word Problems Are Accepted by Abelian G-Automata. | Takao Yuyama |
| 2023 | Languages Generated by Conjunctive Query Fragments of FC[REG]. | Sam M. Thompson, Dominik D. Freydenberger |
| 2023 | Approaching Repetition Thresholds via Local Resampling and Entropy Compression. | Arseny M. Shur |
| 2023 | Synchronizing Automata with Coinciding Cycles. | Jakub Ruszil |
| 2023 | Formal Languages and the NLP Black Box. | William Merrill |
| 2023 | The Domino Problem Is Undecidable on Every Rhombus Subshift. | Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Nos |
| 2023 | Rewriting Rules for Arithmetics in Alternate Base Systems. | Zuzana Maskov, Edita Pelantov, Katarna Studenicov |
| 2023 | Tree-Walking-Storage Automata. | Martin Kutrib, Uwe Meyer |
| 2023 | On the Simon's Congruence Neighborhood of Languages. | Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa |
| 2023 | On Word-Representable and Multi-word-Representable Graphs. | Benny George Kenkireth, Ahaan Sameer Malhotra |