Abstract is missing.
- 2-Word-π-Representable GraphsDuncan Adamson, Amanita Dietz, Pamela Fleischmann, Annika Huch, Silas Cato Sacher. 1-15 [doi]
- Largest Finite Optimal Existential and Universal Widths of Unary AFAsJohn Alajaji, Kai Salomaa. 16-29 [doi]
- On the Average State Complexity of Shuffle IdealsGuilherme Duarte 0001, Markus Holzer 0001, Nelma Moreira, Rogério Reis. 30-45 [doi]
- Quantifying Distance From SimplicityHenning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. 46-59 [doi]
- Some Descriptional Complexity Results for Context-Conditional GrammarsHenning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman, Silas Cato Sacher. 60-73 [doi]
- Exact Accepting-State Spectrum for Reversal of Permutation AutomataSamuel German. 74-82 [doi]
- A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation AutomataSamuel German. 83-93 [doi]
- The Boundary of Closed and Ideal LanguagesJozef Jirásek 0001, Galina Jirásková. 94-109 [doi]
- State-Limited Inductive Inference of Cellular AutomataMartin Kutrib, Ian McQuillan, Priscilla Raucci, Matthias Wendlandt. 110-121 [doi]
- Bounds on the Number of θ-Palindromes in θ-ConjugatesAnuran Maity. 122-132 [doi]
- State Complexity of Shifts of the Fibonacci WordDelaram Moradi, Pierre Popoli, Jeffrey Shallit, Ingrid Vukusic. 133-147 [doi]
- On the Complexity of Multi-entry DFAsNelma Moreira, Rogério Reis, Gonçalo Teixeira. 148-162 [doi]
- Determinizing k-Path Input-Driven PDAsMohammad Zakzok, Kai Salomaa. 163-175 [doi]