The proceedings in this text cover all parts of the theory of formal languages, from pure theoretical investigations to applications to programming languages. Main topics include combinatorial properties of words, and sequences of words and sets of words.

Towards robustness in parsing - fuzzifying context-free language recognition; the computational complexity of PCGS with regular components; prefix and periodic languages of rational w-languages; Cantor sets and Dejean's conjecture; recent developments in trace theory; trace language definable with modular quantifiers; finite state recognizability for two-dimensional languages - a brief survey; on emptiness and counting for alternating finite automata; descriptional and computational complexity measure for distributive generation of languages; nondeterminism degrees of context-free languages; the membership problem for unordered vector languages; transforming a single-valued transducer into a mealy machine.