


default search action
Journal of Automata, Languages and Combinatorics, Volume 28
Volume 28, Numbers 1-3, 2023
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
:
Preface. 3-4 - Ravid Alon, Orna Kupferman

:
Mutually Accepting Capacitated Automata. 5-25 - Stefan Hoffmann

:
State Complexity Bounds for the Commutative Closure of Group Languages. 27-57 - Martin Kutrib

, Andreas Malcher
, Carlo Mereghetti
, Beatrice Palano
:
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. 59-88 - Pierre Marcus

, Ilkka Törmä
:
Winning Sets of Regular Languages: Descriptional and Computational Complexity. 89-120 - Alexander Okhotin

, Elizaveta Sazhneva:
State Complexity of GF(2)-Inverse and GF(2)-Star on Binary Languages. 121-141 - Daniel Prusa

:
Two-Dimensional Rank-Reducing Grammars and Their Complexity. 143-166 - Victor L. Selivanov

:
Wadge Degrees of Classes of ω-Regular k-Partitions. 167-199 - Taylor J. Smith

, Kai Salomaa
:
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata. 201-220 - Martin Vu

, Henning Fernau
:
Insertion-Deletion with Substitutions II: About the Role of One-Sided Context. 221-244
Volume 28, Number 4, 2023
- Carles Cardó

:
Anti-Context-Free Languages. 249-277 - Jürgen Dassow

:
Pareto Grammars. 279-286 - Clelia De Felice

:
Finite Maximal Codes and Factorizations of Cyclic Groups. 287-338

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














