DCFS 2021 ACCEPTED PAPERS

DCFS 2021 Accepted Papers

Sabine Broda, António Machiavelo, Nelma Moreira and Rogério Reis. On the Uniform Distribution of Regular Expressions

Pavel Alaev and Victor Selivanov. Complexity issues for the iterated h-preorders

Chris Keeler and Kai Salomaa. Width Measures of Alternating Finite Automata

Jean Néraud. Gray cycles of maximum length related to $k$-character substitutions

Martin Kutrib and Matthias Wendlandt. State Complexity of Partial Word Finite Automata

Stefan Hoffmann. Sync-Maximal Permutation Groups Equal Primitive Permutation Groups

Stefan Hoffmann. Commutative Regular Languages with Product-Form Minimal Automata

Stefan Hoffmann. State Complexity Bounds for Upward and Downward Closures on Commutative Languages and Commutative Group and Commutative Aperiodic Languages

Olga Martynova and Alexander Okhotin. State complexity of union and intersection on graph-walking automata

Stavros Konstantinidis, António Machiavelo, Nelma Moreira and Rogério Reis. Partial Derivative Automaton by Compressing Regular Expressions

Abuzer Yakaryilmaz. Improved constructions for succinct affine automata

Cas Widdershoven and Stefan Kiefer. Image-Binary Automata

Markus Holzer and Christian Rauch. More on the Descriptional Complexity of Compositions of Finite Automata

Kevin Stier and Markus Ulbricht. Disambiguation of Weighted Tree Automata

Alexander Rubtsov and Mikhail Vyalyi. Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems

Viliam Geffert and Alexander Okhotin. Deterministic one-way simulation of two-way deterministic finite automata over small alphabets