We show that it is decidable in time complexity 2220(n) whether the language accepted by an n-state non-deterministic automaton is of star height one, which is the first ever complexity result for the star height one problem. To achieve this, we introduce distance desert automata as a joint generalization of distance automata and desert automata, and show the decidability of its limitedness problem by solving the underlying Burnside problem. © Springer-Verlag 2004.
CITATION STYLE
Kirsten, D. (2004). Distance desert automata and the star height one problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2987, 257–272. https://doi.org/10.1007/978-3-540-24727-2_19
Mendeley helps you to discover research relevant for your work.