Abstract is missing.
- Operational State Complexity Revisited: The Contribution of Monsters and ModifiersPascal Caron, Jean-Gabriel Luque, Bruno Patrou. 1-20 [doi]
- Hypercubes and Isometric Words Based on Swap and Mismatch DistanceMarcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci. 21-35 [doi]
- Defying Gravity and Gadget Numerosity: The Complexity of the Hanano PuzzleMichael C. Chavrimootoo. 36-50 [doi]
- Existential and Universal Width of Alternating Finite AutomataYo-Sub Han, Sungmin Kim, Sang-Ki Ko, Kai Salomaa. 51-64 [doi]
- On Jaffe's Pumping Lemma, RevisitedMarkus Holzer 0001, Christian Rauch. 65-78 [doi]
- Operational Complexity: NFA-to-DFA Trade-OffMichal Hospodár, Jozef Jirásek 0001, Galina Jirásková, Juraj Sebej. 79-93 [doi]
- The Word Problem for Finitary Automaton GroupsMaximilian Kotowsky, Jan Philipp Wächter. 94-108 [doi]
- Separating Words Problem over GroupsNeha Kuntewar, S. K. M. Anoop, Jayalal Sarma. 109-120 [doi]
- Complexity of Exclusive Nondeterministic Finite AutomataMartin Kutrib, Andreas Malcher, Matthias Wendlandt. 121-133 [doi]
- n Lower BoundOlga Martynova 0001, Alexander Okhotin. 134-145 [doi]
- Pushdown and One-Counter Automata: Constant and Non-constant Memory UsageGiovanni Pighizzini, Luca Prigioniero. 146-157 [doi]
- Construction of a Bi-infinite Power Free Word with a Given Factor and a Non-recurrent LetterJosef Rukavicka. 158-168 [doi]
- Merging Two Hierarchies of External Contextual Grammars with Subregular SelectionBianca Truthe. 169-180 [doi]
- A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free WordsJean Weight, Trienko L. Grobler, Lynette van Zijl, Carlyle Stewart. 181-196 [doi]