DCFS 2020 Accepted Papers

Pierre Marcus and Ilkka Törmä. Descriptional Complexity of Winning Sets of Regular Languages
Ravid Alon and Orna Kupferman. Mutually Accepting Capacitated Automata
Ludwig Staiger. On the Generative Power of Quasiperiods
Victor Selivanov. Classifying ω-Regular Aperiodic k-Partitions
Manfred Droste, Zoltán Fülöp, Dávid Kószó and Heiko Vogler. Crisp-determinization of Weighted Tree Automata over Additively Locally Finite and Past-finite Monotonic Strong Bimonoids Is Decidable
Hannes Seiwert and Ehud Cseresnyes. Regular Expression Length via Arithmetic Circuit Complexity
Hannes Seiwert. Operational Complexity of Straight Line Programs for Regular Languages
Viet Anh Martin Vu and Henning Fernau. Insertion-Deletion Systems With Substitutions II
Chris Keeler and Kai Salomaa. Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata
Taylor Smith and Kai Salomaa. Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata
Daniel Prusa. Complexity of Two-dimensional Rank-reducing Grammars
Martin Kutrib, Andreas Malcher, Carlo Mereghetti and Beatrice Palano. Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion
Stefan Hoffmann. State Complexity Bounds for the Commutative Closure of Group Languages
Josef Rukavicka. Palindromic Length of Words with Many Periodic Palindromes
Alexander Okhotin and Elizaveta Sazhneva. State complexity of GF(2)-inverse and GF(2)-star on binary languages
Jozef Jirasek and Galina Jiraskova. Multiple Catenation and State Complexity
Marcella Anselmo, Dora Giammarresi, Maria Madonia and Carla Selmi. Bad pictures: some structural properties related to overlaps
Stanislav Krymski and Alexander Okhotin. Longer shortest strings in two-way finite automata
Henning Fernau, Lakshmanan Kuppusamy and Indhumathi Raman. On the Power of Generalized Forbidding Insertion-Deletion Systems