Abstract is missing.
- Recent Developments in Quantum Algorithms and ComplexityAndris Ambainis. 1-4 [doi]
- Automata with Reversal-Bounded Counters: A SurveyOscar H. Ibarra. 5-22 [doi]
- Star-Free Languages and Local DivisorsManfred Kufleitner. 23-28 [doi]
- Aperiodic Tilings by Right TrianglesNikolay K. Vereshchagin. 29-41 [doi]
- Quantum Hashing via ε-Universal Hashing Constructions and Freivalds' Fingerprinting SchemasFarid M. Ablayev, Marat Ablayev. 42-52 [doi]
- Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDsFarid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz. 53-64 [doi]
- Matter and Anti-Matter in Membrane SystemsArtiom Alhazov, Bogdan Aman, Rudolf Freund, Gheorghe Paun. 65-76 [doi]
- Complexity of Extended vs. Classic LR ParsersAngelo Borsotti, Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti. 77-89 [doi]
- Most Complex Regular Right-Ideal LanguagesJanusz A. Brzozowski, Gareth Davies. 90-101 [doi]
- State Complexity of Inversion OperationsDa-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa. 102-113 [doi]
- Cycles and Global Attractors of Reaction SystemsEnrico Formenti, Luca Manzoni, Antonio E. Porreca. 114-125 [doi]
- Classical Automata on Promise ProblemsViliam Geffert, Abuzer Yakaryilmaz. 126-137 [doi]
- From Ultrafilters on Words to the Expressive Power of a Fragment of LogicMai Gehrke, Andreas Krebs, Jean-Éric Pin. 138-149 [doi]
- Computation Width and Deviation NumberDaniel Goc, Kai Salomaa. 150-161 [doi]
- Boundary Sets of Regular and Context-Free LanguagesMarkus Holzer, Sebastian Jakobi. 162-173 [doi]
- Biclique Coverings, Rectifier Networks and the Cost of ε-RemovalSzabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán. 174-185 [doi]
- Small Universal Non-deterministic Petri Nets with Inhibitor ArcsSergiu Ivanov 0001, Elisabeth Pelz, Sergey Verlan. 186-197 [doi]
- A Full and Linear Index of a Tree for Tree PatternsJan Janousek, Borivoj Melichar, Radomír Polách, Martin Poliak, Jan Trávnícek. 198-209 [doi]
- Prefix-Free Languages: Right Quotient and ReversalJozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej. 210-221 [doi]
- Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA LanguagesGalina Jirásková, Peter Mlynárcik. 222-233 [doi]
- On the State Complexity of Closures and Interiors of Regular Languages with SubwordsPrateek Karandikar, Philippe Schnoebelen. 234-245 [doi]
- State Complexity of Regular Tree Languages for Tree Pattern MatchingSang-Ki Ko, Ha-Rim Lee, Yo-Sub Han. 246-257 [doi]
- On the Complexity of L-reachabilityBalagopal Komarath, Jayalal Sarma, K. S. Sunil. 258-269 [doi]
- Positive and Negative Proofs for Circuits and Branching ProgramsOlga Dorzweiler, Thomas Flamm, Andreas Krebs, Michael Ludwig. 270-281 [doi]
- Regularity and Size of Set AutomataMartin Kutrib, Andreas Malcher, Matthias Wendlandt. 282-293 [doi]
- Operational State Complexity under Parikh EquivalenceGiovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki. 294-305 [doi]
- Complexity of Checking Whether Two Automata Are Synchronized by the Same LanguageMarina I. Maslennikova. 306-317 [doi]
- On the Descriptional Complexity of Deterministic Ordered Restarting AutomataFriedrich Otto. 318-329 [doi]
- State Complexity of Unary Language Operations for NFAs with Limited NondeterminismAlexandros Palioudakis, Kai Salomaa, Selim G. Akl. 330-341 [doi]
- A Note on Pushdown Automata SystemsHolger Petersen. 342-351 [doi]
- Non-recursive Trade-offs between Two-Dimensional Automata and GrammarsDaniel Prusa. 352-363 [doi]