Abstract is missing.
- Ultrametric Finite Automata and Turing MachinesRusins Freivalds. 1-11 [doi]
- Recompression: Word Equations and BeyondArtur Jez. 12-26 [doi]
- Joint Spectral Characteristics: A Tale of Three DisciplinesRaphaël M. Jungers. 27-28 [doi]
- Unambiguous Finite AutomataChristof Löding. 29-30 [doi]
- An Explicit Formula for the Intersection of Two Polynomials of Regular LanguagesJean-Éric Pin. 31-45 [doi]
- Two Dimensional Prefix Codes of PicturesMarcella Anselmo, Dora Giammarresi, Maria Madonia. 46-57 [doi]
- Adjacent Ordered Multi-Pushdown SystemsMohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan. 58-69 [doi]
- Cuts in Regular ExpressionsMartin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce Watson. 70-81 [doi]
- Quantum Finite Automata and Linear Context-Free Languages: A Decidable ProblemAlberto Bertoni, Christian Choffrut, Flavio D'Alessandro. 82-93 [doi]
- On the Asymptotic Abelian Complexity of Morphic WordsFrancine Blanchet-Sadri, Nathan Fox. 94-105 [doi]
- Strict Bounds for Pattern AvoidanceFrancine Blanchet-Sadri, Brent Woodhouse. 106-117 [doi]
- A Fresh Approach to Learning Register AutomataBenedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege. 118-130 [doi]
- Suffixes, Conjugates and Lyndon WordsSilvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino. 131-142 [doi]
- Extremal Words in the Shift Orbit Closure of a Morphic SequenceJames D. Currie, Narad Rampersad, Kalle Saari. 143-154 [doi]
- Inner Palindromic ClosureJürgen Dassow, Florin Manea, Robert Mercas, Mike Müller. 155-166 [doi]
- On the Dual Post Correspondence ProblemJoel D. Day, Daniel Reidenbach, Johannes C. Schneider. 167-178 [doi]
- Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic AutomataSven De Felice, Cyril Nicaud. 179-190 [doi]
- A Coloring Problem for Sturmian and Episturmian WordsAldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni. 191-202 [doi]
- The Chomsky-Schützenberger Theorem for Quantitative Context-Free LanguagesManfred Droste, Heiko Vogler. 203-214 [doi]
- Operational Characterization of Scattered MCFLsZoltán Ésik, Szabolcs Iván. 215-226 [doi]
- Abelian Repetitions in Sturmian WordsGabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston. 227-238 [doi]
- Composition Closure of ε-Free Linear Extended Top-Down Tree TransducersZoltán Fülöp, Andreas Maletti. 239-251 [doi]
- Subword Complexity and k-SynchronizationDaniel Goc, Luke Schaeffer, Jeffrey Shallit. 252-263 [doi]
- Some Decision Questions Concerning the Time Complexity of Language AcceptorsOscar H. Ibarra, Bala Ravikumar. 264-276 [doi]
- Unambiguous Conjunctive Grammars over a One-Letter AlphabetArtur Jez, Alexander Okhotin. 277-288 [doi]
- Alternative Automata Characterization of Piecewise Testable LanguagesOndrej Klíma, Libor Polák. 289-300 [doi]
- Finite Automata with Advice TapesUgur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz. 301-312 [doi]
- One-Way Multi-Head Finite Automata with Pebbles But No StatesMartin Kutrib, Andreas Malcher, Matthias Wendlandt. 313-324 [doi]
- Regular Expressions with Binding over Data Words for Querying Graph DatabasesLeonid Libkin, Tony Tan, Domagoj Vrgoc. 325-337 [doi]
- Factorizations and Universal Automaton of Omega LanguagesVincent Carnino, Sylvain Lombardy. 338-349 [doi]
- Deciding Determinism of Unary Languages Is coNP-CompletePing Lu, Feifei Peng, Haiming Chen. 350-361 [doi]
- Ultimate Periodicity of b-Recognisable Sets: A Quasilinear ProcedureVictor Marsault, Jacques Sakarovitch. 362-373 [doi]
- 3-Abelian Cubes Are Avoidable on Binary AlphabetsRobert Mercas, Aleksi Saarela. 374-383 [doi]
- Repetition Avoidance in Circular FactorsHamoon Mousavi, Jeffrey Shallit. 384-395 [doi]
- Operator Precedence ω-LanguagesFederica Panella, Matteo Pradella, Violetta Lonati, Dino Mandrioli. 396-408 [doi]
- New Results on Deterministic Sgraffito AutomataDaniel Prusa, Frantisek Mráz, Friedrich Otto. 409-419 [doi]
- On the Number of Abelian Bordered WordsNarad Rampersad, Michel Rigo, Pavel Salimov. 420-432 [doi]
- Proof of a Phase Transition in Probabilistic Cellular AutomataDamien Regnault. 433-444 [doi]
- Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of GrowthArseny M. Shur. 445-457 [doi]