Abstract is missing.
- Equational Theories of Scattered and Countable Series-Parallel PosetsAmazigh Amrane, Nicolas Bedon. 1-13 [doi]
- Scattered Factor-Universality of WordsLaura Barker, Pamela Fleischmann, Katharina Harwardt, Florin Manea, Dirk Nowotka. 14-28 [doi]
- On Normalish Subgroups of the R. Thompson GroupsCollin Bleak. 29-42 [doi]
- Computing the Shortest String and the Edit-Distance for Parsing Expression LanguagesHyunjoon Cheon, Yo-Sub Han. 43-54 [doi]
- An Approach to the Herzog-Schönheim Conjecture Using AutomataFabienne Chouraqui. 55-68 [doi]
- On the Fine Grained Complexity of Finite Automata Non-emptiness of IntersectionMateus de Oliveira Oliveira, Michael Wehar. 69-82 [doi]
- The State Complexity of Lexicographically Smallest Words and Computing SuccessorsLukas Fleischer, Jeffrey O. Shallit. 83-95 [doi]
- Reconstructing Words from Right-Bounded-Block WordsPamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo. 96-109 [doi]
- A Study of a Simple Class of Modifiers: Product ModifiersPascal Caron, Edwin Hamel-De le Court, Jean-Gabriel Luque. 110-121 [doi]
- Operations on Permutation AutomataMichal Hospodár, Peter Mlynárcik. 122-136 [doi]
- Space Complexity of Stack Automata ModelsOscar H. Ibarra, Jozef Jirásek Jr., Ian McQuillan, Luca Prigioniero. 137-149 [doi]
- Descriptional Complexity of Semi-simple Splicing SystemsLila Kari, Timothy Ng 0001. 150-163 [doi]
- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial EquationsFlorent Koechlin, Cyril Nicaud, Pablo Rotondo. 164-177 [doi]
- Dynamics of Cellular Automata on Beta-Shifts and Direct Topological FactorizationsJohan Kopra. 178-191 [doi]
- Avoidability of Additive Cubes over Alphabets of Four NumbersFlorian Lietard, Matthieu Rosenfeld. 192-206 [doi]
- Equivalence of Linear Tree Transducers with Output in the Free GroupRaphaela Löbel, Michael Luttenberger, Helmut Seidl. 207-221 [doi]
- On the Balancedness of Tree-to-Word TransducersRaphaela Löbel, Michael Luttenberger, Helmut Seidl. 222-236 [doi]
- On Tree Substitution GrammarsAndreas Maletti, Kevin Stier. 237-250 [doi]
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular AutomataAugusto Modanese. 251-265 [doi]
- Complexity of Searching for 2 by 2 Submatrices in Boolean MatricesDaniel Prusa, Michael Wehar. 266-279 [doi]
- Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract)Eric Rowland, Manon Stipulanti. 280-293 [doi]
- Transition Property for α-Power Free Languages with $\alpha \ge 2$ and $k\ge 3$ LettersJosef Rukavicka. 294-303 [doi]
- Context-Freeness of Word-MIX LanguagesRyoma Sin'ya. 304-318 [doi]
- The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order BalancednessAndrea Frosini, Lama Tarsissi. 319-331 [doi]