Abstract
We study the state complexity of language operations for unary NFAs with limited nondeterminism. We consider the operations of concatenation, Kleene star, and complement. We give upper bounds for the state complexity of these language operations and lower bounds that are fairly close to the upper bounds. Our constructions rely on the fact that minimal unary NFAs with limited nondeterminism can be found in Chrobak normal form. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Palioudakis, A., Salomaa, K., & Akl, S. G. (2014). State complexity of unary language operations for NFAs with limited nondeterminism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8614 LNCS, pp. 330–341). Springer Verlag. https://doi.org/10.1007/978-3-319-09704-6_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
