- Amena Assem, Hanna Derets and Chrystopher L. Nehaniv:
Algebraic Characterizations for Minors of Finite Graphs via Flow Transformation Monoid Division and Embedding - Paul Bell, Eva Foster and Daniel Reidenbach:
Irreducibility of Endomorphisms of Finitely Generated Free Semigroups - Maurice Bornett Herwig and Norbert Hundeshagen:
Correcting Deterministic Finite Automata for Didactic Feedback - Da-Jung Cho, Szilárd Zsolt Fazekas and Max Wiedenhöft:
Deterministic Bandwidth of Finite Languages - Yoav Danieli:
Pumping Constants for Infinite Alphabets - Manfred Droste, Zoltán Fülöp, Andreja Tepavcevic and Heiko Vogler:
The generating power of weighted tree automata with initial algebra semantics - Szilárd Zsolt Fazekas, Xinhao Huang and Robert Mercas:
Subsequence Analysis Problems for Binary Parikh Matrices - Zhidan Feng, Pamela Fleischmann, Henning Fernau, Kevin Mann and Silas Cato Sacher:
Generalized Word-Representability: Possibilities and Limitations - Klaus Jansen, Dirk Nowotka, Lis Pirotton, Corinna Wambsganz and Max Wiedenhöft:
An Analysis of Decision Problems for Relational Pattern Languages under Various Constraints - Stavros Konstantinidis:
Independent Languages and Witnesses of Dependence (Non-satisfaction) - Gábor Kusper:
A Non-CDCL SAT Solver with Early Conflict Detection: The Watched-Literal-Based CSFLOC Solver - Martin Kutrib, Ian McQuillan, Priscilla Raucci and Matthias Wendlandt:
Inductive Inference of Cellular Automata - Benedek Nagy:
Reverse Post Correspondence Problem and Undecidability of 5′ -> 3′ String Assembly Systems - Giovanni Pighizzini:
Turn Complexity and Bounded Languages - Pierluigi San Pietro, Stefano Crespi Reghizzi and Antonio Restivo:
Guillotine and Tiling Cofiniteness in Unary Picture Languages - Olle Torstensson:
Weighted Alternating Tree Automata - Irina Virbitskaite and Nataliya Gribovskaya:
Transition Systems from Causal Reversible Bundle Event Structures - Anssi Yli-Jyrä:
Recognizers for Graph-Encoding Languages