Abstract is missing.
- Unambiguity in Automata TheoryThomas Colcombet. 3-18 [doi]
- Partial Derivative Automaton for Regular Expressions with ShuffleSabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis. 21-32 [doi]
- Upper Bound on Syntactic Complexity of Suffix-Free LanguagesJanusz A. Brzozowski, Marek Szykula. 33-45 [doi]
- Nondeterministic Tree Width of Regular LanguagesCezar Câmpeanu, Kai Salomaa. 46-57 [doi]
- Integer Complexity: Experimental and Analytical Results IIJuris Cernenoks, Janis Iraids, Martins Opmanis, Rihards Opmanis, Karlis Podnieks. 58-69 [doi]
- Square on Ideal, Closed and Free LanguagesKristína Cevorová. 70-80 [doi]
- A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2]Jacques Duparc, Kevin Fournier. 81-92 [doi]
- Compressibility of Finite Languages by GrammarsSebastian Eberhard, Stefan Hetzl. 93-104 [doi]
- On the Complexity and Decidability of Some Problems Involving ShuffleJoey Eremondi, Oscar H. Ibarra, Ian McQuillan. 105-116 [doi]
- On the Computational Complexity of Problems Related to Distinguishability SetsMarkus Holzer, Sebastian Jakobi. 117-128 [doi]
- Prefix-Free Subsets of Regular Languages and Descriptional ComplexityJozef Stefan Jirásek, Juraj Sebej. 129-140 [doi]
- Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic ProblemsLila Kari, Stavros Konstantinidis, Steffen Kopecki. 141-152 [doi]
- On Simulation Cost of Unary Limited AutomataMartin Kutrib, Matthias Wendlandt. 153-164 [doi]
- On Some Decision Problems for Stateless Deterministic Ordered Restarting AutomataKent Kwee, Friedrich Otto. 165-176 [doi]
- Quantum Queries on PermutationsTaisia Mischenko-Slatenkova, Alina Vasilieva, Ilja Kucevalovs, Rusins Freivalds. 177-184 [doi]
- Complement on Free and Ideal LanguagesPeter Mlynárcik. 185-196 [doi]
- Universal Disjunctive Concatenation and StarNelma Moreira, Giovanni Pighizzini, Rogério Reis. 197-208 [doi]
- Quasi-Distances and Weighted Finite AutomataTimothy Ng, David Rappaport, Kai Salomaa. 209-219 [doi]
- The State Complexity of Permutations on Finite Languages over Binary AlphabetsAlexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa. 220-230 [doi]
- Star-Complement-Star on Prefix-Free LanguagesMatús Palmovský, Juraj Sebej. 231-242 [doi]
- Groups Whose Word Problem is a Petri Net LanguageGabriela Asli Rino Nesin, Richard M. Thomas. 243-255 [doi]
- Regular Realizability Problems and Context-Free LanguagesAlexander A. Rubtsov, Mikhail N. Vyalyi. 256-267 [doi]
- Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State AutomatonHellis Tamm. 268-279 [doi]
- Quantum State Complexity of Formal LanguagesMarcos Villagra, Tomoyuki Yamakami. 280-291 [doi]