Abstract is missing.
- Recognisable Languages over MonadsMikolaj Bojanczyk. 1-13 [doi]
- Garside and Quadratic Normalisation: A SurveyPatrick Dehornoy. 14-45 [doi]
- Grammar-Based Tree CompressionMarkus Lohrey. 46-57 [doi]
- On Decidability of Intermediate Levels of Concatenation HierarchiesJorge Almeida, Jana Bartonová, Ondrej Klíma, Michal Kunc. 58-70 [doi]
- Ergodic Infinite Permutations of Minimal ComplexitySergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina. 71-84 [doi]
- Diverse Palindromic Factorization Is NP-completeHideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto. 85-96 [doi]
- Factorization in Formal LanguagesPaul C. Bell, Daniel Reidenbach, Jeffrey Shallit. 97-107 [doi]
- Consensus Game AcceptorsDietmar Berwanger, Marie van den Bogaard. 108-119 [doi]
- On the Size of Two-Way Reasonable Automata for the Liveness ProblemMaria Paola Bianchi, Juraj Hromkovic, Ivan Kovác. 120-131 [doi]
- Squareable WordsFrancine Blanchet-Sadri, Abraham Rashin. 132-142 [doi]
- Complexity Analysis: Transformation Monoids of Finite AutomataChristian Brandl, Hans-Ulrich Simon. 143-154 [doi]
- Palindromic Complexity of TreesSrecko Brlek, Nadia Lafrenière, Xavier Provençal. 155-166 [doi]
- Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck ShiftsMarie-Pierre Béal, Pavel Heller. 167-178 [doi]
- Transfinite Lyndon WordsLuc Boasson, Olivier Carton. 179-190 [doi]
- Unary Patterns with PermutationsJames D. Currie, Florin Manea, Dirk Nowotka. 191-202 [doi]
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local ChangeChristopher Czyba, Christopher Spinrath, Wolfgang Thomas. 203-214 [doi]
- Enumeration Formulæ in Neutral SetsFrancesco Dolce, Dominique Perrin. 215-227 [doi]
- On the Density of Context-Free and Counter LanguagesJoey Eremondi, Oscar H. Ibarra, Ian McQuillan. 228-239 [doi]
- *-Continuous Kleene \omega ω -AlgebrasZoltán Ésik, Uli Fahrenberg, Axel Legay. 240-251 [doi]
- Unary Probabilistic and Quantum Automata on Promise ProblemsAida Gainutdinova, Abuzer Yakaryilmaz. 252-263 [doi]
- Generalizations of Code Languages with Marginal ErrorsYo-Sub Han, Sang-Ki Ko, Kai Salomaa. 264-275 [doi]
- Minimal Reversible Deterministic Finite AutomataMarkus Holzer, Sebastian Jakobi, Martin Kutrib. 276-287 [doi]
- Multi-sequential Word RelationsIsmaël Jecker, Emmanuel Filiot. 288-299 [doi]
- The Boundary of Prefix-Free LanguagesJozef Jirásek, Galina Jirásková. 300-312 [doi]
- A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside GroupInes Klimann, Matthieu Picantin, Dmytro Savchuk. 313-325 [doi]
- Path Checking for MTL and TPTL over Data WordsShiguang Feng, Markus Lohrey, Karin Quaas. 326-339 [doi]
- On Distinguishing NC ^1 1 and NLAndreas Krebs, Klaus-Jörn Lange, Michael Ludwig. 340-351 [doi]
- Surminimisation of AutomataVictor Marsault. 352-363 [doi]
- On the Complexity of k-Piecewise Testability and the Depth of AutomataTomás Masopust, Michaël Thomazo. 364-376 [doi]
- Interval Exchange Words and the Question of Hof, Knill, and SimonZuzana Masáková, Edita Pelantová, Stepán Starosta. 377-388 [doi]
- State Complexity of Neighbourhoods and Approximate Pattern MatchingTimothy Ng, David Rappaport, Kai Salomaa. 389-400 [doi]
- Deterministic Ordered Restarting Automata that Compute FunctionsFriedrich Otto, Kent Kwee. 401-412 [doi]
- Weight Assignment LogicVitaly Perevoshchikov. 413-425 [doi]
- Complexity Bounds of Constant-Space Quantum Computation - (Extended Abstract)Tomoyuki Yamakami. 426-438 [doi]