Abstract is missing.
- Reaction Systems: A Model of Computation Inspired by BiochemistryAndrzej Ehrenfeucht, Grzegorz Rozenberg. 1-3 [doi]
- A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional LanguagesDora Giammarresi. 4-15 [doi]
- The Complexity of Regular(-Like) ExpressionsMarkus Holzer, Martin Kutrib. 16-30 [doi]
- On Decision Problems for Simple and Parameterized MachinesOscar H. Ibarra. 31 [doi]
- Numeration Systems: A Link between Number Theory and Formal Language TheoryMichel Rigo. 33-53 [doi]
- Algorithmic Properties of Millstream SystemsSuna Bensch, Henrik Björklund, Frank Drewes. 54-65 [doi]
- On a Conjecture by Carpi and D AlessandroMikhail V. Berlinkov. 66-75 [doi]
- Linking Algebraic Observational Equivalence and BisimulationMouhebeddine Berrima, Narjes Ben Rajeb. 76-87 [doi]
- Undecidability and Hierarchy Results for Parallel Communicating Finite AutomataHenning Bordihn, Martin Kutrib, Andreas Malcher. 88-99 [doi]
- Inclusion Problems for Patterns with a Bounded Number of VariablesJoachim Bremer, Dominik D. Freydenberger. 100-111 [doi]
- On the Average Number of States of Partial Derivative AutomataSabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis. 112-123 [doi]
- On the Hybrid Cerný-Road Coloring Problem and Hamiltonian PathsArturo Carpi, Flavio D Alessandro. 124-135 [doi]
- Computing Blocker Sets for the Regular Post Embedding ProblemPierre Chambart, Philippe Schnoebelen. 136-147 [doi]
- Rankers over Infinite Words - (Extended Abstract)Luc Dartois, Manfred Kufleitner, Alexander Lauser. 148-159 [doi]
- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded LatticesManfred Droste, Heiko Vogler. 160-172 [doi]
- On Müller Context-Free GrammarsZoltán Ésik, Szabolcs Iván. 173-184 [doi]
- Minimization of Deterministic Bottom-Up Tree TransducersSylvia Friese, Helmut Seidl, Sebastian Maneth. 185-196 [doi]
- Two-Way Unary Automata versus Logarithmic SpaceViliam Geffert, Giovanni Pighizzini. 197-208 [doi]
- On the Periodicity of Morphic WordsVesa Halava, Tero Harju, Tomi Kärki, Michel Rigo. 209-217 [doi]
- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph GroupsNiko Haubold, Markus Lohrey, Christian Mathissen. 218-230 [doi]
- Using Light to Implement Parallel Boolean AlgebraTom Head. 231-242 [doi]
- Periodicity in TilingsEmmanuel Jeandel, Pascal Vanier. 243-254 [doi]
- Complexity in Union-Free Regular LanguagesGalina Jirásková, Tomás Masopust. 255-266 [doi]
- Schema for Parallel Insertion and DeletionLila Kari, Shinnosuke Seki. 267-278 [doi]
- On Schützenberger Products of SemiringsOndrej Klíma, Libor Polák. 279-290 [doi]
- On Language Equations ::::XXK:::: = ::::XXL:::: and ::::XM:::: = ::::N:::: over a Unary AlphabetTommi Lehtinen, Alexander Okhotin. 291-302 [doi]
- Around Dot Depth TwoKamal Lodaya, Paritosh K. Pandya, Simoni S. Shah. 303-315 [doi]
- Input Products for Weighted Extended Top-Down Tree TransducersAndreas Maletti. 316-327 [doi]
- Regular Hedge Language Factorization RevisitedMircea Marin, Temur Kutsia. 328-339 [doi]
- Fast Parsing for Boolean Grammars: A Generalization of Valiant s AlgorithmAlexander Okhotin. 340-351 [doi]
- On Lexicalized Well-Behaved Restarting Automata That Are MonotoneFriedrich Otto, Martin Plátek, Frantisek Mráz. 352-363 [doi]
- On a Powerful Class of Non-universal P Systems with Active MembranesAntonio E. Porreca, Alberto Leporati, Claudio Zandron. 364-375 [doi]
- State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular LanguagesElena V. Pribavkina, Emanuele Rodaro. 376-386 [doi]
- Restricted Ambiguity of Erasing MorphismsDaniel Reidenbach, Johannes C. Schneider. 387-398 [doi]
- Automata with Extremal Minimality ConditionsAntonio Restivo, Roberto Vaglica. 399-410 [doi]
- On the Existence of Minimal ::::beta::::-PowersArseny M. Shur. 411-422 [doi]
- The Averaging Trick and the Cerný ConjectureBenjamin Steinberg. 423-431 [doi]
- Pseudo-power AvoidanceEhsan Chiniforooshan, Lila Kari, Zhi Xu. 432-433 [doi]
- On Restricted Context-Free GrammarsJürgen Dassow, Tomás Masopust. 434-435 [doi]
- Graphs Capturing Alternations in WordsMagnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin. 436-437 [doi]
- On the Iterated Hairpin CompletionSteffen Kopecki. 438-439 [doi]
- On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract)Natalie Schluter. 440-441 [doi]
- Joint Topologies for Finite and Infinite WordsLudwig Staiger. 442-443 [doi]