Abstract is missing.
- On First-Order Fragments for Words and Mazurkiewicz TracesVolker Diekert, Manfred Kufleitner. 1-19 [doi]
- Quantitative Generalizations of LanguagesThomas A. Henzinger. 20-22 [doi]
- What Do We Know About Language Equations?Michal Kunc. 23-27 [doi]
- Information Distance and ApplicationsMing Li. 28 [doi]
- Finite Automata and the Writing of NumbersJacques Sakarovitch. 29-30 [doi]
- Descriptional Complexity of Nondeterministic Finite AutomataKai Salomaa. 31-35 [doi]
- From Determinism to Non-determinism in Recognizable Two-Dimensional LanguagesMarcella Anselmo, Dora Giammarresi, Maria Madonia. 36-47 [doi]
- Coding Partitions: Regularity, Maximality and Global AmbiguityMarie-Pierre Béal, Fabio Burderi, Antonio Restivo. 48-59 [doi]
- Multi-letter Reversible and Quantum Finite AutomataAleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs. 60-71 [doi]
- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace MonoidsAlberto Bertoni, Roberto Radicioni. 72-83 [doi]
- The Dynamics of Cellular Automata in Shift-Invariant TopologiesLaurent Bienvenu, Mathieu Sablik. 84-95 [doi]
- Two Element Unavoidable Sets of Partial WordsFrancine Blanchet-Sadri, N. C. Brownstein, Justin Palumbo. 96-107 [doi]
- Hairpin Finite AutomataHenning Bordihn, Markus Holzer, Martin Kutrib. 108-119 [doi]
- Characterizing Reduction Graphs for Gene Assembly in CiliatesRobert Brijder, Hendrik Jan Hoogeboom. 120-131 [doi]
- 2-Visibly Pushdown AutomataDario Carotenuto, Aniello Murano, Adriano Peron. 132-144 [doi]
- An Efficient Computation of the Equation ::::K::::-Automaton of a Regular ::::K::::-ExpressionJean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi. 145-156 [doi]
- An Extension of Newton s Method to ::::omega:::: -Continuous SemiringsJavier Esparza, Stefan Kiefer, Michael Luttenberger. 157-168 [doi]
- Non-constructive Methods for Finite Probabilistic AutomataRusins Freivalds. 169-180 [doi]
- The Unambiguity of Segmented MorphismsDominik D. Freydenberger, Daniel Reidenbach. 181-192 [doi]
- Commutation of Binary Factorial LanguagesAnna E. Frid. 193-204 [doi]
- Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NPHermann Gruber, Markus Holzer. 205-216 [doi]
- State Complexity of Union and Intersection of Finite LanguagesYo-Sub Han, Kai Salomaa. 217-228 [doi]
- Bisimulation Minimisation for Weighted Tree AutomataJohanna Högberg, Andreas Maletti, Jonathan May. 229-241 [doi]
- Conjunctive Grammars Can Generate Non-regular Unary LanguagesArtur Jez. 242-253 [doi]
- Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed AlphabetJozef Jirásek, Galina Jirásková, Alexander Szabari. 254-265 [doi]
- Reduced Languages as ::::omega:::: -GeneratorsSandrine Julia, Tran Vinh Duc. 266-277 [doi]
- Avoiding Approximate SquaresDalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey Shallit. 278-289 [doi]
- Duplication RootsPeter Leupold. 290-299 [doi]
- Complexity Theory for Splicing SystemsRemco Loos, Mitsunori Ogihara. 300-311 [doi]
- Descriptional Complexity of Bounded Context-Free LanguagesAndreas Malcher, Giovanni Pighizzini. 312-323 [doi]
- Definable Transductions and Weighted Logics for TextsChristian Mathissen. 324-336 [doi]
- A Star Operation for Star-Free Trace LanguagesEdward Ochmanski, Krystyna Stawikowska. 337-345 [doi]
- Finite Automata on Unranked and Unordered DAGsLutz Priese. 346-360 [doi]
- On Almost Periodicity Criteria for Morphic Sequences in Some Particular CasesYuri Pritykin. 361-370 [doi]
- A Local Balance Property of Episturmian WordsGwénaël Richomme. 371-381 [doi]
- Suffix Automata and Standard Sturmian WordsMarinella Sciortino, Luca Q. Zamboni. 382-398 [doi]
- Fine Hierarchy of Regular Aperiodic ::::omega:::: -LanguagesVictor L. Selivanov. 399-410 [doi]
- On Transition Minimality of Bideterministic AutomataHellis Tamm. 411-421 [doi]