Abstract is missing.
- The Kind Hearted Dragon Prof. Sheng Yu, 1950-2012Andrew Szilard. 1-6 [doi]
- P and dP Automata: Unconventional versus Classical AutomataErzsébet Csuhaj-Varjú. 7-22 [doi]
- Recovering Strings in Oracles: Quantum and ClassicKazuo Iwama. 23 [doi]
- Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical FormulæJuraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec. 24-39 [doi]
- Cellular Automata, the Collatz Conjecture and Powers of 3/2Jarkko Kari. 40-49 [doi]
- Quotient Complexities of Atoms of Regular LanguagesJanusz A. Brzozowski, Hellis Tamm. 50-61 [doi]
- Decidability of Geometricity of Regular LanguagesMarie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy. 62-72 [doi]
- Inside the Class of REGEX LanguagesMarkus L. Schmid. 73-84 [doi]
- Computing the Edit-Distance between a Regular Language and a Context-Free LanguageYo-Sub Han, Sang-Ki Ko, Kai Salomaa. 85-96 [doi]
- Semigroups with a Context-Free Word ProblemMichael Hoffmann 0002, Derek F. Holt, Matthew D. Owens, Richard M. Thomas. 97-108 [doi]
- Generalized Derivations with Synchronized Context-Free GrammarsMarkus Holzer, Sebastian Jakobi, Ian McQuillan. 109-120 [doi]
- Non-erasing Variants of the Chomsky-Schützenberger TheoremAlexander Okhotin. 121-129 [doi]
- Regular and Context-Free Pattern Languages over Small AlphabetsDaniel Reidenbach, Markus L. Schmid. 130-141 [doi]
- On Context-Free Languages of Scattered WordsZoltán Ésik, Satoshi Okawa. 142-153 [doi]
- Homomorphisms Preserving Deterministic Context-Free LanguagesTommi Lehtinen, Alexander Okhotin. 154-165 [doi]
- Unary Coded NP-Complete Languages in ASPACE (log log n)Viliam Geffert, Dana Pardubská. 166-177 [doi]
- Dense CompletenessAndreas Krebs, Klaus-Jörn Lange. 178-189 [doi]
- From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract)Markus Holzer, Sebastian Jakobi. 190-201 [doi]
- Analogs of Fagin's Theorem for Small Nondeterministic Finite AutomataChristos A. Kapoutsis, Nans Lefebvre. 202-213 [doi]
- States and Heads Do Count for Unary Multi-head Finite AutomataMartin Kutrib, Andreas Malcher, Matthias Wendlandt. 214-225 [doi]
- Visibly Pushdown Automata with Multiplicities: Finiteness and K-BoundednessMathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot. 226-238 [doi]
- Unambiguous Constrained AutomataMichaël Cadilhac, Alain Finkel, Pierre McKenzie. 239-250 [doi]
- Two-Dimensional Sgraffito AutomataDaniel Prusa, Frantisek Mráz. 251-262 [doi]
- Two-Way Transducers with a Two-Way Output TapeOlivier Carton. 263-272 [doi]
- Learning Rational FunctionsAdrien Boiret, Aurélien Lemay, Joachim Niehren. 273-283 [doi]
- Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic AutomataGiovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki. 284-295 [doi]
- Fine and Wilf's Theorem for k-Abelian PeriodsJuhani Karhumäki, Svetlana Puzynina, Aleksi Saarela. 296-307 [doi]
- Pseudoperiodic WordsAlexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé. 308-319 [doi]
- Acceptance Conditions for ω-LanguagesAlberto Dennunzio, Enrico Formenti, Julien Provillard. 320-331 [doi]
- Checking Determinism of Regular Expressions with CountingHaiming Chen, Ping Lu. 332-343 [doi]
- Biautomata for k-Piecewise Testable LanguagesOndrej Klíma, Libor Polák. 344-355 [doi]
- On Centralized PC Grammar Systems with Context-Sensitive ComponentsFriedrich Otto. 356-367 [doi]
- Unidirectional Derivation Semantics for Synchronous Tree-Adjoining GrammarsMatthias Büchse, Andreas Maletti, Heiko Vogler. 368-379 [doi]
- The State Complexity of Star-Complement-StarGalina Jirásková, Jeffrey Shallit. 380-391 [doi]
- On State Complexity of Finite Word and Tree LanguagesAniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu. 392-403 [doi]
- Squares in Binary Partial WordsFrancine Blanchet-Sadri, Yang Jiao, John M. Machacek. 404-415 [doi]
- The Avoidability of Cubes under PermutationsFlorin Manea, Mike Müller, Dirk Nowotka. 416-427 [doi]
- Hairpin Completion with Bounded Stem-LoopSzilárd Zsolt Fazekas, Robert Mercas, Kayoko Shikishima-Tsuji. 428-439 [doi]
- Morphic Primitivity and Alphabet ReductionsHossein Nevisi, Daniel Reidenbach. 440-451 [doi]
- On a Hierarchy of Languages with Catenation and ShuffleNils Erik Flick, Manfred Kudlek. 452-458 [doi]
- Characterizing Languages by Normalization and Termination in String Rewriting - (Extended Abstract)Jeroen Ketema, Jakob Grue Simonsen. 459-464 [doi]
- Geometry and Dynamics of the Besicovitch and Weyl SpacesVille Salo, Ilkka Törmä. 465-470 [doi]
- A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering DelayLaura Giambruno, Sabrina Mantaci, Jean Neraud, Carla Selmi. 471-476 [doi]