Invited Talks
Morphic sequences versus automatic sequences
Parsimonious Computational Completeness Pointlike sets and separation: a personal perspective
Regular Papers
A strong non-overlapping Dyck code
Active Learning of Sequential Transducers with Side Information about the Domain
Compositions of Constant Weighted Extended Tree Transducers
Extremal Binary PFAs in a Cerny Family
Variations on the Post Correspondence Problem for Free Groups
Reducing local alphabet size in recognizable picture languages
Properties of Graphs Specified by a Regular Language
Balanced-by-construction regular and omega-regular languages
Weighted Prefix Normal Words: Mind the Gap
Two-Way Non-Uniform Finite Automata
Integer Weighted Automata on Infinite Words
Deciding FO2 Alternation for Automata over Finite and Infinite Words
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
Lyndon words formalized in Isabelle/HOL
The Range of State Complexities of Languages Resulting from the Cascade Product he General Case (Extended Abstract)
Second-order finite automata: expressive power and simple proofs using automatic structures
Reversible Top-Down Syntax Analysis
Symmetry groups of infinite words
Bounded Languages Described by GF(2)-grammas
Definability Results for Top-Down Tree Transducers
The hardest LL(k) language
Upper Bounds on Distinct Maximal (Sub- )Repetitions in Compressed Strings
Branching Frequency and Markov Entropy of Repetition-Free Languages
A Linear-time Simulation of Deterministic d-Limited Automata
Caratheodory Extensions of Subclasses of Regular Languages
Parikh Word Representable Graphs and Morphisms.