Abstract is missing.
- Modern Aspects of Complexity Within Formal LanguagesHenning Fernau. 3-30 [doi]
- Observation and Interaction - Invited PaperEdward A. Lee. 31-42 [doi]
- From Words to Graphs, and BackVadim V. Lozin. 43-54 [doi]
- An Oracle Hierarchy for Small One-Way Finite AutomataM. Anabtawi, S. Hassan, Christos A. Kapoutsis, M. Zakzok. 57-69 [doi]
- Orbits of Abelian Automaton GroupsTim Becker, Klaus Sutner. 70-81 [doi]
- Bounded Automata Groups are co-ET0LAlex Bishop, Murray Elder. 82-94 [doi]
- Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular AutomataAlberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara, Antonio E. Porreca. 95-107 [doi]
- On Varieties of Ordered AutomataOndrej Klíma 0001, Libor Polák. 108-120 [doi]
- Automata over Infinite Sequences of RealsKlaus Meer, Ameen Naif. 121-133 [doi]
- Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size AdviceTomoyuki Yamakami. 134-145 [doi]
- Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape AutomataVladimir A. Zakharov. 146-158 [doi]
- Efficient Symmetry Breaking for SAT-Based Minimum DFA InferenceIlya Zakirzyanov, António Morgado, Alexey Ignatiev, Vladimir Ulyantsev, João Marques-Silva. 159-173 [doi]
- Closure and Nonclosure Properties of the Compressible and Rankable SetsJackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery. 177-189 [doi]
- The Range of State Complexities of Languages Resulting from the Cut OperationMarkus Holzer 0001, Michal Hospodár. 190-202 [doi]
- State Complexity of PseudocatenationLila Kari, Timothy Ng 0001. 203-214 [doi]
- Complexity of Regex CrosswordsStephen Fenner, Daniel Padé. 215-230 [doi]
- Generalized Predictive Shift-Reduce Parsing for Hyperedge Replacement Graph GrammarsBerthold Hoffmann, Mark Minas. 233-245 [doi]
- Transformation of Petri Nets into Context-Dependent Fusion GrammarsHans-Jörg Kreowski, Sabine Kuske, Aaron Lye. 246-258 [doi]
- Generalized Register Context-Free GrammarsRyoma Senda, Yoshiaki Takata, Hiroyuki Seki. 259-271 [doi]
- Logic and Rational Languages of Scattered and Countable Series-Parallel PosetsAmazigh Amrane, Nicolas Bedon. 275-287 [doi]
- Toroidal Codes and Conjugate PicturesMarcella Anselmo, Maria Madonia, Carla Selmi. 288-301 [doi]
- Geometrical Closure of Binary V_3/2 LanguagesJean-Philippe Dubernard, Giovanna Guaiana, Ludovic Mignot. 302-314 [doi]
- Deterministic Biautomata and Subclasses of Deterministic Linear LanguagesGalina Jirásková, Ondrej Klíma 0001. 315-327 [doi]
- Learning Unions of k-Testable LanguagesAlexis Linard, Colin de la Higuera, Frits W. Vaandrager. 328-339 [doi]
- Regular Matching and Inclusion on Compressed Tree Patterns with Context VariablesIovka Boneva, Joachim Niehren, Momar Sakho. 343-355 [doi]
- Rule-Based Unification in Combined Theories and the Finite Variant PropertyAjay Kumar Eeralla, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen. 356-367 [doi]
- Extensions of the Caucal Hierarchy?Pawel Parys. 368-380 [doi]
- Tight Bounds on the Minimum Size of a Dynamic MonopolyAhad N. Zehmakan. 381-393 [doi]
- Recurrence in Multidimensional WordsÉmilie Charlier, Svetlana Puzynina, Élise Vandomme. 397-408 [doi]
- A Note with Computer Exploration on the Triangle ConjectureChristophe Cordero. 409-420 [doi]
- Efficient Representation and Counting of Antipower Factors in WordsTomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba. 421-433 [doi]
- On the Maximum Number of Distinct Palindromic Sub-arraysKalpana Mahalingam, Palak Pandoh. 434-446 [doi]
- Syntactic View of Sigma-Tau Generation of PermutationsWojciech Rytter, Wiktor Zuba. 447-459 [doi]
- Palindromic Subsequences in Finite WordsClemens Müllner, Andrew Ryzhikov. 460-468 [doi]