Abstract is missing.
- Automata: From Uncertainty to QuantumCristian Calude, Elena Calude. 1-14 [doi]
- Elementary Theory of Ordinals with Addition and Left Translation by omegaChristian Choffrut. 15-20 [doi]
- The Equational Theory of Fixed Points with Applications to Generalized Language TheoryZoltán Ésik. 21-36 [doi]
- Second-Order Logic over Strings: Regular and Non-regular FragmentsThomas Eiter, Georg Gottlob, Thomas Schwentick. 37-56 [doi]
- Decision Questions on Integer MatricesTero Harju. 57-68 [doi]
- Some Petri Net Languages and CodesMasami Ito, Yoshiyuki Kunimoch. 69-80 [doi]
- Words, Permutations, and Representations of NumbersHelmut Prodinger. 81-99 [doi]
- Proof Complexity of Pigeonhole PrinciplesAlexander A. Razborov. 100-116 [doi]
- Words and PatternsAntonio Restivo, Sergio Salemi. 117-129 [doi]
- A Short Introduction to Infinite AutomataWolfgang Thomas. 130-144 [doi]
- The Power of One-Letter Rational LanguagesThierry Cachat. 145-154 [doi]
- The Entropy of Lukasiewicz-LanguagesLudwig Staiger. 155-165 [doi]
- Collapsing Words vs. Synchronizing WordsDimitry S. Ananichev, Mikhail V. Volkov. 166-174 [doi]
- A Note on Synchronized Automata and Road Coloring ProblemKarel Culik II, Juhani Karhumäki, Jarkko Kari. 175-185 [doi]
- Shuffle Quotient and DecompositionsCezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi. 186-196 [doi]
- The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive LanguagesGundula Niemann, Jens R. Woinowski. 197-205 [doi]
- Recognizable Sets of N-Free Pomsets Are Monadically AxiomatizableDietrich Kuske. 206-216 [doi]
- Automata on Series-Parallel BiposetsZoltán Ésik, Zoltán L. Németh. 217-227 [doi]
- Hierarchies of String Languages Generated by Deterministic Tree TransducersJoost Engelfriet, Sebastian Maneth. 228-238 [doi]
- Partially-Ordered Two-Way Automata: A New Characterization of DAThomas Schwentick, Denis Thérien, Heribert Vollmer. 239-250 [doi]
- Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter AlphabetsChristian Glaßer, Heinz Schmitz. 251-261 [doi]
- On the Power of Randomized Pushdown AutomataJuraj Hromkovic, Georg Schnitger. 262-271 [doi]
- The Root of a Language and Its ComplexityGerhard Lischke. 272-280 [doi]
- Valuated and Valence Grammars: An Algebraic ViewHenning Fernau, Ralf Stiebe. 281-292 [doi]
- Context-Free Valence Grammars - RevisitedHendrik Jan Hoogeboom. 293-303 [doi]
- An Undecidability Result Concerning Periodic MorphismsVesa Halava, Tero Harju. 304-310 [doi]
- A Universal Turing Machine with 3 States and 9 SymbolsManfred Kudlek, Yurii Rogozhin. 311-318 [doi]
- Minimal Covers of Formal LanguagesMichael Domaratzki, Jeffrey Shallit, Sheng Yu. 319-329 [doi]
- Some Regular Languages That Are Church-Rosser CongruentialGundula Niemann, Johannes Waldmann. 330-339 [doi]
- On the Relationship between the McNaughton Families of Languages and the Chomsky HierarchyMartin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto. 340-348 [doi]
- Forbidden Factors and Fragment AssemblyFilippo Mignosi, Antonio Restivo, Marinella Sciortino. 349-358 [doi]
- Parallel Communicating Grammar Systems with Incomplete Information CommunicationErzsébet Csuhaj-Varjú, György Vaszil. 359-368 [doi]
- Eliminating Communication by Parallel RewritingBranislav Rovan, Marián Slast an. 369-278 [doi]
- String Rewriting Sequential P-Systems and Regulated RewritingPetr Sosík, Rudolf Freund. 379-388 [doi]