Abstract is missing.
- Open Problems on Avoidable Patterns in Partial WordsFrancine Blanchet-Sadri. 12-24
- On relations of finite words over infinite alphabetsChristian Choffrut. 25-27
- K-Restricted Duplication Closure of LanguagesMasami Ito. 28-33
- Notes on Hyper-minimizationAndreas Maletti. 34-49
- Equational descriptions of languagesJean-Éric Pin. 50-63
- Grammar Systems as Orchestras of Grammatical ServicesGemma Bel Enguix, María Adela Grando, Maria Dolores Jiménez-López. 65-78
- Channel Synthesis for Finite TransducersGilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier H. Roux, Mathieu Sassolas. 79-92
- On Operations Preserving Primitivity of Partial Words with One HoleFrancine Blanchet-Sadri, Sarah Nelson, Amelia Tebbe. 93-107
- The Inclusion Problem for Weighted Automata on Infinite TreesStefan Borgwardt, Rafael Peñaloza. 108-122
- Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular LanguagesJanusz A. Brzozowski, Galina Jirásková, Baiyu Li, Joshua Smith. 123-137
- Quotient Complexity of Star-Free LanguagesJanusz A. Brzozowski, Bo Liu. 138-152
- Varieties of Languages and Frontier CheckAntonio Cano, Eija Jurvanen. 153-167
- n-Accepting Restricted Pushdown Automata SystemsMartin Cermák, Alexander Meduna. 168-183
- Palindromes and PrimitivitySzilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji. 184-196
- The Chop of LanguagesMarkus Holzer, Sebastian Jakobi, Martin Kutrib. 197-210
- Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic MachinesOscar H. Ibarra, Shinnosuke Seki. 211-224
- Müller context-free grammars generating well-ordered wordsSzabolcs Iván, Ágnes Mészáros. 225-240
- De Bruijn Sequences RevisitedLila Kari, Zhi Xu. 241-254
- Around Dot-Depth OneManfred Kufleitner, Alexander Lauser. 255-269
- Algebraic Properties of Petri Net Morphisms based on Place ConnectivityYoshiyuki Kunimochi. 270-284
- Hyper-minimisation of deterministic weighted finite automata over semifieldsAndreas Maletti, Daniel Quernheim. 285-299
- Accepting Networks of Evolutionary Processors with Subregular FiltersFlorin Manea, Bianca Truthe. 300-314
- On Nondeterminism in Programmed GrammarsAlexander Meduna, Lukás Vrábel, Petr Zemek. 315-327
- Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-AutomataBenedek Nagy, Friedrich Otto. 328-342
- Tree Homomorphisms for Unranked TreesXiaoxue Piao, Kai Salomaa, Sándor Vágvölgyi. 343-357
- Towards Shortest Synchronizing Words in Polynomial TimeVedala T. K. Pramod, Kanduru V. Krishna. 358-367
- Recent Developments in Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata and Their State-Efficient ImplementationsHiroshi Umeo. 368-387
- Algorithms for the Efficient Calculation of the Holonomy DecompositionAttila Egri-Nagy, James D. Mitchell, Chrystopher L. Nehaniv. 389-390
- Symmetries of AutomataAttila Egri-Nagy, Chrystopher L. Nehaniv. 391
- Affordance Graphs for User Interface Design: Application of Category-theoretic ConstructsEsther-Anna Loeliger, Chrystopher L. Nehaniv. 392-394