Abstract is missing.
- Formal Languages and the NLP Black BoxWilliam Merrill. 1-8 [doi]
- Jumping Automata over Infinite WordsShaull Almagor, Omer Yizhaq. 9-22 [doi]
- Isometric Words Based on Swap and Mismatch DistanceMarcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci. 23-35 [doi]
- Set Augmented Finite Automata over Infinite AlphabetsAnsuman Banerjee, Kingshuk Chatterjee, Shibashis Guha. 36-50 [doi]
- Fast Detection of Specific Fragments Against a Set of SequencesMarie-Pierre Béal, Maxime Crochemore. 51-60 [doi]
- Weak Inverse Neighborhoods of LanguagesHyunjoon Cheon, Yo-Sub Han. 61-73 [doi]
- The Exact State Complexity for the Composition of Root and ReversalPascal Caron, Alexandre Durand, Bruno Patrou. 74-85 [doi]
- Bit Catastrophes for the Burrows-Wheeler TransformSara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina. 86-99 [doi]
- The Domino Problem Is Undecidable on Every Rhombus SubshiftBenjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Noûs. 100-112 [doi]
- Synchronization of Parikh AutomataStefan Hoffmann 0001. 113-127 [doi]
- Completely Distinguishable Automata and the Set of Synchronizing WordsStefan Hoffmann 0001. 128-142 [doi]
- Zielonka DAG Acceptance and Regular Languages over Infinite WordsChristopher Hugenroth. 143-155 [doi]
- On Word-Representable and Multi-word-Representable GraphsBenny George Kenkireth, Ahaan Sameer Malhotra. 156-167 [doi]
- On the Simon's Congruence Neighborhood of LanguagesSungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa. 168-181 [doi]
- Tree-Walking-Storage AutomataMartin Kutrib, Uwe Meyer 0003. 182-194 [doi]
- Rewriting Rules for Arithmetics in Alternate Base SystemsZuzana Masáková, Edita Pelantová, Katarína Studenicová. 195-207 [doi]
- Synchronizing Automata with Coinciding CyclesJakub Ruszil. 208-218 [doi]
- Approaching Repetition Thresholds via Local Resampling and Entropy CompressionArseny M. Shur. 219-232 [doi]
- Languages Generated by Conjunctive Query Fragments of FC[REG]Sam M. Thompson, Dominik D. Freydenberger. 233-245 [doi]
- Groups Whose Word Problems Are Accepted by Abelian G-AutomataTakao Yuyama. 246-257 [doi]