Accepted papers

The selected papers represent high-quality research across a broad range of topics within the scope of formal systems and their descriptional complexity. We thank all authors for their submissions and look forward to welcoming the contributors and participants to the conference.

List of papers

Fibonacci Pictures on a Binary Alphabet
Marcella Anselmo, Dora Giammarresi, Maria Madonia, and Carla Selmi

A Close Analysis of the Subset Construction
Ivan Baburin and Ryan Cotterell

k-local Graphs
Christian Beth, Pamela Fleischmann, Annika Huch, Daniyal Kazempour, Peer Kröoger, Andrea Kulow, and Matthias Ren

Word-Representable Graphs and Locality of Words
Philipp Böll, Pamela Fleischmann, Annika Huch, Jana Kreiß, Tim Löck, Kajus Park, and Max Wiedenhöft

Automata for Synchronised Shuffle on Backbones
Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis

Two-Word Shuffle: Some Results
Guilherme Duarte, Nelma Moreira, and Rogério Reis

Matrix Forbidding Grammars
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman, and György Vaszil

On the Decidability and Expressive Power of Several Theories Based on String Constraints
Justus Greve-Kramer, Tore Koß, Florin Manea, and Timo Specht

Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals are Computationally Complete
Martin Havel, Alexander Meduna, and Zbyněk Křivka

Disjunctive Complexity
Nikita Ivanov, Alexander Rubtsov, and Mikhail Vyalyi

Two-Way Finite Automata with Translucent Input Letters
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, and Beatrice Palano

Relative Densities of Formal Languages
Juan Andres Montoya

On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words
František Mráz and Friedrich Otto

What is the Most Natural Generalization of the Pumping Lemmas for Regular and Context-Free Languages?
Tomoyuki Yamakami

Small Balanced Vertex Separators in NFA to Regular Expression Conversion
Derek Youngman and Kai Salomaa