Abstract is missing.
- Block Sorting-Based Transformations on Words: Beyond the Magic BWTRaffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino. 1-17 [doi]
- The Runs Theorem and BeyondTomohiro I. 18-23 [doi]
- A Brief Excursion to Parity GamesBakhadyr Khoussainov. 24-35 [doi]
- A Tale of Conjunctive GrammarsAlexander Okhotin. 36-59 [doi]
- Groups, Languages and Dendric ShiftsDominique Perrin. 60-73 [doi]
- Some Open Problems in Polyomino TilingsAndrew Winslow. 74-82 [doi]
- Weak Cost Register Automata Are Still PowerfulShaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez. 83-95 [doi]
- From Two-Way Transducers to Regular Function ExpressionsNicolas Baudru, Pierre-Alain Reynier. 96-108 [doi]
- Decidability of Right One-Way Jumping Finite AutomataSimon Beier, Markus Holzer 0001. 109-120 [doi]
- Additive Number Theory via Approximation by Regular LanguagesJason P. Bell, Thomas Finn Lidbetter, Jeffrey Shallit. 121-132 [doi]
- Tree-to-Graph Transductions with ScopeJohanna Björklund. 133-144 [doi]
- A Characterization of Completely Reachable AutomataEugenija A. Bondar, Mikhail V. Volkov. 145-155 [doi]
- Inequalities for One-Step ProductsMário J. J. Branco, Jean-Éric Pin. 156-168 [doi]
- On the Commutative Equivalence of Context-Free LanguagesArturo Carpi, Flavio D'Alessandro. 169-181 [doi]
- Simon's Theorem for Scattered WordsOlivier Carton, Maurice Pouzet. 182-193 [doi]
- The Synchronizing Probability Function for Primitive Sets of MatricesCostanza Catalano, Raphaël M. Jungers. 194-205 [doi]
- Recognizability for AutomataDidier Caucal, Chloé Rispal. 206-218 [doi]
- Site-Directed DeletionDa-Jung Cho, Yo-Sub Han, Hwee Kim, Kai Salomaa. 219-230 [doi]
- Counting Subwords and Regular LanguagesCharles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey Shallit. 231-242 [doi]
- Deque Languages, Automata and Planar GraphsStefano Crespi-Reghizzi, Pierluigi San Pietro. 243-255 [doi]
- A General Approach to State Complexity of Operations: Formalization and LimitationsSylvie Davies. 256-268 [doi]
- On Matching Generalised Repetitive PatternsJoel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka, Markus L. Schmid. 269-281 [doi]
- Intersection Non-emptiness and Hardness Within Polynomial TimeMateus de Oliveira Oliveira, Michael Wehar. 282-290 [doi]
- Complexity of Decision Problems on Totally Rigid Acyclic Tree GrammarsSebastian Eberhard, Gabriel Ebner, Stefan Hetzl. 291-303 [doi]
- A Pattern Logic for Automata with OutputsEmmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin. 304-317 [doi]
- The Intersection Problem for Finite SemigroupsLukas Fleischer. 318-329 [doi]
- On Completely Reachable Automata and Subset ReachabilityFrançois Gonze, Raphaël M. Jungers. 330-341 [doi]
- On Minimal Grammar Problems for Finite LanguagesHermann Gruber, Markus Holzer 0001, Simon Wolfsteiner. 342-353 [doi]
- Reversible Pushdown TransducersBruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero. 354-365 [doi]
- Two-Way Automata and One-Tape Machines - Read Only Versus Linear TimeBruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa. 366-378 [doi]
- Dynamics of the Independence Number and Automata SynchronizationVladimir V. Gusev, Raphaël M. Jungers, Daniel Prusa. 379-391 [doi]
- Closest Substring Problems for Regular LanguagesYo-Sub Han, Sang-Ki Ko, Timothy Ng 0001, Kai Salomaa. 392-403 [doi]
- Computational Complexity of Decision Problems on Self-verifying Finite AutomataMarkus Holzer 0001, Sebastian Jakobi, Jozef Jirásek Jr.. 404-415 [doi]
- Generalizations of Checking Stack Automata: Characterizations and HierarchiesOscar H. Ibarra, Ian McQuillan. 416-428 [doi]
- On Counting Functions of LanguagesOscar H. Ibarra, Ian McQuillan, Bala Ravikumar. 429-440 [doi]
- Towards Exact State Complexity Bounds for Input-Driven Pushdown AutomataGalina Jirásková, Alexander Okhotin. 441-452 [doi]
- On Abelian SubshiftsJuhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland. 453-464 [doi]
- Reachability Problems in Nondeterministic Polynomial Maps on the IntegersSang-Ki Ko, Reino Niskanen, Igor Potapov. 465-477 [doi]
- Projection for Büchi Tree Automata with Constraints Between SiblingsPatrick Landwehr, Christof Löding. 478-490 [doi]
- The Computational Power of Parsing Expression GrammarsBruno Loff, Nelma Moreira, Rogério Reis. 491-502 [doi]
- On Finitely Ambiguous Büchi AutomataChristof Löding, Anton Pirogov. 503-515 [doi]
- Uniformization Problem for Variants of First Order Logic over Finite WordsVincent Michielini. 516-528 [doi]
- On Deterministic Ordered Restart-Delete AutomataFriedrich Otto. 529-540 [doi]
- Complementation of Finitely Ambiguous Büchi AutomataAlexander Rabinovich. 541-552 [doi]
- A Structural Lemma for Deterministic Context-Free LanguagesAlexander A. Rubtsov. 553-565 [doi]