Abstract is missing.
- Completely Reachable AutomataEugenija A. Bondar, Mikhail V. Volkov. 1-17 [doi]
- Heapability, Interactive Particle Systems, Partial Orders: Results and Open ProblemsGabriel Istrate, Cosmin Bonchis. 18-28 [doi]
- Self-Verifying Finite Automata and Descriptional ComplexityGalina Jirásková. 29-44 [doi]
- On the State Complexity of Partial Derivative Automata For Regular Expressions with IntersectionRafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis. 45-59 [doi]
- Unrestricted State Complexity of Binary Operations on Regular LanguagesJanusz A. Brzozowski. 60-72 [doi]
- On the State Complexity of the Shuffle of Regular LanguagesJanusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula. 73-86 [doi]
- MSO-definable Properties of Muller Context-Free Languages Are DecidableZoltán Ésik, Szabolcs Iván. 87-97 [doi]
- Contextual Array Grammars with Matrix and Regular ControlHenning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian. 98-110 [doi]
- Descriptional Complexity of Graph-Controlled Insertion-Deletion SystemsHenning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. 111-125 [doi]
- Operations on Weakly Recognizing MorphismsLukas Fleischer, Manfred Kufleitner. 126-137 [doi]
- Descriptional Complexity of Bounded Regular LanguagesAndrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt. 138-152 [doi]
- The Complexity of Languages Resulting from the Concatenation OperationGalina Jirásková, Alexander Szabari, Juraj Sebej. 153-167 [doi]
- Minimal and Reduced Reversible AutomataGiovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero. 168-179 [doi]
- Unary Self-verifying Symmetric Difference AutomataLaurette Marais, Lynette van Zijl. 180-191 [doi]
- State Complexity of Prefix Distance of Subregular LanguagesTimothy Ng 0001, David Rappaport, Kai Salomaa. 192-204 [doi]
- Two Results on Discontinuous Input ProcessingVojtech Vorel. 205-216 [doi]