- 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.