Open Problems About Regular Languages, 35 Years Later
From MaRDI portal
Publication:4683188
DOI10.1142/9789813148208_0007zbMath1402.68120OpenAlexW2608248596MaRDI QIDQ4683188
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_0007
finite semigroupsregular languagesdot-depth hierarchystar heightlimitedness problemgroup complexityregularity of non-counting classesoptimality of prefix codesrestricted star heightstar removal
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (4)
Concatenation hierarchies: new bottle, old wine ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ Monadic monadic second order logic ⋮ Generic results for concatenation hierarchies
This page was built for publication: Open Problems About Regular Languages, 35 Years Later