Developments in Language Theory

Finite Automata and Regular Languages On Automatic Transitive Graphs.- Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals.- On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States.- State Complexity of Deletion.- Semisimple Synchronizing Automata and the Wedderburn-Artin Theory.- On two Algorithmic Problems about Synchronizing Automata (short paper).- Synchronizing Automata with Random Inputs (short paper).- Graph Spectral Properties of Deterministic Finite Automata (short paper).- Pushdown Automata and Related Models.- Input-Driven Pushdown Automata with Limited Nondeterminism (invited paper).- How to Remove the Look-Ahead of Top-Down Tree Transducers.- Scope-Bounded Pushdown Languages.- Visibly Pushdown Transducers with Well-nested Outputs.- Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing.- Pumping Lemma and Ogden Lemma for Displacement Context-free Grammars.- Combinatorics and Algorithmics on Words Aperiodic Tilings and Entropy .- On k-Abelian Pattern Matching.- On k-Abelian Palindromic Rich and Poor Words.- Variations of The Morse{Hedlund Theorem for k-Abelian Equivalence.- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word.- Knight Tiles: Particles and Collisions in The Realm of 4-Way Deterministic Tilings .- Eigenvalues and Transduction of Morphic Sequences.- Breadth-First Serialisation of Trees and Rational Languages (short paper).- Algebraic, Decidability and Complexity Problems for Languages Measuring Communication in Automata Systems (invited paper).- From Algebra to Logic: There and Back Again { The Story of A Hierarchy (invited paper).- Closure Properties of Pattern Languages.- Minimal and Hyper-Minimal Biautomata.- Deterministic Set Automata.- The Minimum Amount of Useful Space: New Results and New Directions.- Debates with Small Transparent Quantum Verifiers.- Embedding Finite and Infinite Words into OverlappingTiles.