Table of Contents

Block sorting-based transformations on words: beyond the magic BWT.- The Runs Theorem and Beyond.- A Brief Excursion to Parity Games.- A tale of conjunctive grammars.- Groups, languages and dendric shifts.- Some Open Problems in Polyomino Tilings.- Weak Cost Register Automata are Still Powerful.- From Two-Way Transducers to Regular Function Expressions.- Decidability of Right One-Way Jumping Finite Automata.- Additive Number Theory via Approximation by Regular Languages.- Tree-to-graph transductions with scope.- A Characterization of Completely Reachable Automata.- Inequalities for one-step products.- On the commutative equivalence of context-free languages.- Simon's theorem for scattered words.- The Synchronizing Probability Function for Primitive Sets of Matrices.- Recognizability for automata.- Site-Directed Deletion.- Counting Subwords and Regular Languages.- Deque languages, automata and planar graphs.- A General Approach to State Complexity of Operations: Formalization and Limitations.- On Matching Generalised Repetitive Patterns.- Intersection Non-Emptiness and Hardness within Polynomial Time.- Complexity of decision problems on totally rigid acyclic tree grammars.- A Pattern Logic for Automata with Outputs.- The Intersection Problem for Finite Semigroups.- On Completely Reachable Automata and Subset Reachability.- On Minimal Grammar Problems for Finite Languages.- Reversible Pushdown Transducers.- Two-way Automata and One-Tape Machines: Read Only versus Linear Time.- Dynamics of the Independence Number and Automata Synchronization.- Closest Substring Problems for Regular Languages.- Computational Complexity of Decision Problems on Self-Verifying Finite Automata.- Generalizations of Checking Stack Automata: Characterizations and Hierarchies.- On Counting Functions of Languages.- Towards exact state complexity bounds for input-driven pushdown automata.- On Abelian Subshifts.- Reachability Problems in Nondeterministic Polynomial Maps on the Integers.- Projection for Büchi Tree Automata with Constraints between Siblings.- The Computational Power of Parsing Expression Grammars.- On finitely ambiguous Büchi automata.- Uniformization Problem for Variants of First Order Logic over Finite Words.- On deterministic ordered restart-delete automata.- Complementation of Finitely Ambiguous Büchi Automata.- A Structural Lemma for Deterministic Context-Free Languages.