Structure and Complexity of Some Subregular Language Families

DOI10.1142/9789813148208_0003zbMath1394.68214OpenAlexW2608948350MaRDI QIDQ4683184

Markus Holzer, Martin Kutrib

Publication date: 20 September 2018

Published in: The Role of Theory in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789813148208_0003

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages ⋮ Union-complexities of Kleene plus operation ⋮ Operational union-complexity

This page was built for publication: Structure and Complexity of Some Subregular Language Families