Developments in Language Theory 28th International Conference, DLT 2024, Göttingen, Germany, August 12–16, 2024, Proceedings

This book constitutes the refereed proceedings of the 28th International Conference on Developments in Language Theory, DLT 2024, held in Göttingen, Germany, during August 12–16, 2024.

The 17 full papers and 4 invited papers included in this book were carefully reviewed and selected from 26 submissions. They presented current developments in formal languages and automata. The scope is very general and includes, among others, the following topics and areas: grammars, acceptors and transducers for words; trees and graphs; relations between formal languages and artificial neural networks; algebraic theories of automata; algorithmic, combinatorial, and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; groups and semigroups generated by automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory, and logic; bio-inspired computing; and quantum computing.

.- Word equations, constraints and formal languages.

.- Algorithms and combinatorics on two-dimensional strings.

.- Polyregular Functions – Characterisations and Refutations.

.- Cellular Automata: From Black-and-White to High Gloss Color.

.- Deciding Conjugacy of a Rational Relation.

.- Logic and Languages of Higher-Dimensional Automata.

.- Universal Rewriting Rules for the Parikh Matrix Injectivity Problem.

.- $O_2$ is a multiple context-free grammar: an implementation-, formalisation-friendly proof.

.- Cyclic Operator Precedence Grammars for Improved Parallel Parsing.

.- On the complexity and approximability of Bounded access Lempel Ziv coding.

.- How to Find Long Maximal Exact Matches and Ignore Short Ones.

.- The Pumping Lemma for Context-Free Languages is Undecidable .

.- Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors.

.- Semidirect Product Decompositions for Periodic Regular Languages.

.- Approximate Cartesian Tree Pattern Matching.

.- Deterministic Pushdown Automata with Translucent Input Letters.

.- Network Topologies for Parallel Communicating Finite Automata: Token-Ring and Token-Bus.

.- Finite Automata with Sets of Translucent Words.

.- Careful Synchronization of One-Cluster Automata.

.- Verifying And Interpreting Neural Networks using Finite Automata.

.- Around Don’s conjecture for binary completely reachable automata.