Abstract is missing.
- Iteration SemiringsZoltán Ésik. 1-20 [doi]
- Various Aspects of Finite Quantum AutomataMika Hirvensalo. 21-33 [doi]
- On the Hardness of Determining Small NFA s and of Proving Lower Bounds on Their SizesJuraj Hromkovic, Georg Schnitger. 34-55 [doi]
- Selected Ideas Used for Decidability and Undecidability of BisimilarityPetr Jancar. 56-71 [doi]
- The Frobenius Problem and Its GeneralizationsJeffrey Shallit. 72-83 [doi]
- Well Quasi-orders in Formal Language TheoryFlavio D Alessandro, Stefano Varricchio. 84-95 [doi]
- On the Non-deterministic Communication Complexity of Regular LanguagesAnil Ada. 96-107 [doi]
- General Algorithms for Testing the Ambiguity of Finite AutomataCyril Allauzen, Mehryar Mohri, Ashish Rastogi. 108-120 [doi]
- Emptiness of Multi-pushdown Automata Is 2ETIME-CompleteMohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl. 121-133 [doi]
- The Average State Complexity of the Star of a Finite Set of Words Is LinearFrédérique Bassino, Laura Giambruno, Cyril Nicaud. 134-145 [doi]
- On the Computational Capacity of Parallel Communicating Finite AutomataHenning Bordihn, Martin Kutrib, Andreas Malcher. 146-157 [doi]
- On a Generalization of Standard Episturmian MorphismsMichelangelo Bucci, Aldo de Luca, Alessandro De Luca. 158-169 [doi]
- Universal Recursively Enumerable Sets of StringsCristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan. 170-182 [doi]
- Algorithmically Independent SequencesCristian S. Calude, Marius Zimand. 183-195 [doi]
- Relationally Periodic Sequences and Subword ComplexityJulien Cassaigne, Tomi Kärki, Luca Q. Zamboni. 196-205 [doi]
- Bounds on Powers in StringsMaxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera. 206-215 [doi]
- When Is Reachability Intrinsically Decidable?Barbara F. Csima, Bakhadyr Khoussainov. 216-227 [doi]
- Some New Modes of Competence-Based Derivations in CD Grammar SystemsErzsébet Csuhaj-Varjú, Jürgen Dassow, György Vaszil. 228-239 [doi]
- The Synchronization Problem for Strongly Transitive AutomataArturo Carpi, Flavio D Alessandro. 240-251 [doi]
- On the Decidability of the Equivalence for k-Valued TransducersRodrigo de Souza. 252-263 [doi]
- Decidable Properties of 2D Cellular AutomataAlberto Dennunzio, Enrico Formenti. 264-275 [doi]
- Fixed Point and Aperiodic TilingsBruno Durand, Andrei E. Romashchenko, Alexander Shen. 276-288 [doi]
- Extended Multi Bottom-Up Tree TransducersJoost Engelfriet, Eric Lilin, Andreas Maletti. 289-300 [doi]
- Derivation Tree Analysis for Accelerated Fixed-Point ComputationJavier Esparza, Stefan Kiefer, Michael Luttenberger. 301-313 [doi]
- Tree Automata with Global ConstraintsEmmanuel Filiot, Jean-Marc Talbot, Sophie Tison. 314-326 [doi]
- Bad News on Decision Problems for PatternsDominik D. Freydenberger, Daniel Reidenbach. 327-338 [doi]
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial TimePawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit. 339-358 [doi]
- More Concise Representation of Regular Languages by Automata and Regular ExpressionsViliam Geffert, Carlo Mereghetti, Beatrice Palano. 359-370 [doi]
- A Taxonomy of Deterministic Forgetting AutomataJens Glöckler. 371-382 [doi]
- Provably Shorter Regular Expressions from Deterministic Finite AutomataHermann Gruber, Markus Holzer. 383-395 [doi]
- Large Simple Binary Equality WordsJana Hadravová, Stepan Holub. 396-407 [doi]
- On the Relation between Periodicity and Unbordered Factors of Finite WordsStepan Holub, Dirk Nowotka. 408-418 [doi]
- Duplication in DNA SequencesMasami Ito, Lila Kari, Zachary Kincaid, Shinnosuke Seki. 419-430 [doi]
- On the State Complexity of Complements, Stars, and Reversals of Regular LanguagesGalina Jirásková. 431-442 [doi]
- On the State Complexity of Operations on Two-Way Finite AutomataGalina Jirásková, Alexander Okhotin. 443-454 [doi]
- On the Size Complexity of Rotating and Sweeping AutomataChristos A. Kapoutsis, Richard Královic, Tobias Mömke. 455-466 [doi]
- An Analysis and a Reproof of Hmelevskii s TheoremJuhani Karhumäki, Aleksi Saarela. 467-478 [doi]
- Hierarchies of Piecewise Testable LanguagesOndrej Klíma, Libor Polák. 479-490 [doi]
- Construction of Tree Automata from Regular ExpressionsDietrich Kuske, Ingmar Meinecke. 491-503 [doi]
- Balance Properties and Distribution of Squares in Circular WordsRoberto Mantaci, Sabrina Mantaci, Antonio Restivo. 504-515 [doi]
- MSO Logic for Unambiguous Shared-Memory SystemsRémi Morin. 516-528 [doi]
- Complexity of Topological Properties of Regular omega-LanguagesVictor L. Selivanov, Klaus W. Wagner. 529-542 [doi]