Abstract is missing.
- Word Equations, Constraints, and Formal LanguagesLaura Ciobanu. 1-12 [doi]
- Polyregular Functions Characterisations and Refutations - Characterisations and RefutationsSandra Kiefer. 13-21 [doi]
- Cellular Automata: From Black-and-White to High Gloss ColorMartin Kutrib, Andreas Malcher. 22-36 [doi]
- Deciding Conjugacy of a Rational Relation - (Extended Abstract)C. Aiswarya, Amaldev Manuel, Saina Sunny. 37-50 [doi]
- Logic and Languages of Higher-Dimensional AutomataAmazigh Amrane, Hugo Bazille, Uli Fahrenberg, Marie Fortin. 51-67 [doi]
- Universal Rewriting Rules for the Parikh Matrix Injectivity ProblemIngyu Baek, Joonghyuk Hahn, Yo-Sub Han, Kai Salomaa. 68-81 [doi]
- 2 is a Multiple Context-Free Grammar: An Implementation-, Formalisation-Friendly ProofMarco B. Caminati. 82-97 [doi]
- Cyclic Operator Precedence Grammars for Improved Parallel ParsingMichele Chiari, Dino Mandrioli, Matteo Pradella. 98-113 [doi]
- On the Complexity and Approximability of Bounded Access Lempel Ziv CodingFerdinando Cicalese, Francesca Ugazio. 114-130 [doi]
- How to Find Long Maximal Exact Matches and Ignore Short OnesTravis Gagie. 131-140 [doi]
- The Pumping Lemma for Context-Free Languages is UndecidableHermann Gruber, Markus Holzer 0001, Christian Rauch 0001. 141-155 [doi]
- Techniques for Showing the Decidability of the Boundedness Problem of Language AcceptorsOscar H. Ibarra, Ian McQuillan. 156-172 [doi]
- Semidirect Product Decompositions for Periodic Regular LanguagesYusuke Inoue, Kenji Hashimoto, Hiroyuki Seki. 173-188 [doi]
- Approximate Cartesian Tree Pattern MatchingSungmin Kim, Yo-Sub Han. 189-202 [doi]
- Deterministic Pushdown Automata with Translucent Input LettersMartin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt. 203-217 [doi]
- Network Topologies for Parallel Communicating Finite Automata: Token-Ring and Token-BusPhilomena Moek. 218-235 [doi]
- Finite Automata with Sets of Translucent WordsBenedek Nagy, Friedrich Otto. 236-251 [doi]
- Careful Synchronization of One-Cluster AutomataJakub Ruszil. 252-265 [doi]
- Verifying and Interpreting Neural Networks Using Finite AutomataMarco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange. 266-281 [doi]
- Around Don's Conjecture for Binary Completely Reachable AutomataYinfeng Zhu 0001. 282-295 [doi]