VOLUME 28 2023 NUMBERS 1–3

Special Issues with Selected and Extended Versions of Papers Accepted at the 22nd Conference on Descriptional Complexity of Formal Systems (DCFS 2020)

Galina Jirásková, Giovanni Pighizzini:
Preface3–4
Ravid Alon, Orna Kupferman:
Mutually Accepting Capacitated Automata5–25
Stefan Hoffmann:
State Complexity Bounds for the Commutative Closure of Group Languages27–57
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion59–88
Pierre Marcus, Ilkka Törmä:
Winning Sets of Regular Languages: Descriptional and Computational Complexity89–120
Alexander Okhotin, Elizaveta Sazhneva:
State Complexity of GF(2)-Inverse and GF(2)-Star on Binary Languages121–141
Daniel Průša:
Two-Dimensional Rank-Reducing Grammars and Their Complexity143–166
Victor Selivanov:
Wadge Degrees of Classes of ω-Regular k-Partitions167–199
Taylor J. Smith, Kai Salomaa:
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata201–220
Martin Vu, Henning Fernau:
Insertion-Deletion with Substitutions II: About the Role of One-Sided Context221–244