We prove that the automaton presented by Maslov [Soviet Math. Doklady 11, 1373-1375(1970] meets the upper bound 3/4 · 2 n on the state complexity of Kleene closure. This fixes a small error in this paper that claimed the upper bound 3/4 · 2 n − 1. Our main result shows that the upper bounds 2 n−1 + 2 n−1−k on the state complexity of Kleene closure of a language accepted by an n-state DFA with k final states are tight for every k in the binary case. We also present some results of our calculations. We consider not only the worst case, but we study all possible values that can be obtained as the state complexity of Kleene closure of a regular language accepted by a minimal n-state DFA. Using the lists of pairwise non-isomorphic binary automata of 2,3,4, and 5 states, we compute the frequencies of the resulting complexities for Kleene closure, and show that every value in the range from 1 to 3/4 ·2 n occurs at least ones. In the case of n = 6, 7, 8, we change the strategy, and consider binary automata, in which the first symbol is a circular shift of the states, and the second symbol is generated randomly. We show that all values from 1 to 3/4 · 2 n are attainable, that is, for every m with 1 ≤ m ≤ 3/4 · 2 n , there exists an nstate binary DFA A such that the state complexity of L(A) * is exactly m.
We study the complexity of basic regular operations on languages represented by incomplete deterministic or nondeterministic automata, in which all states are final. Such languages are known to be prefix-closed. We get tight bounds on both incomplete and nondeterministic state complexity of complement, intersection, union, concatenation, star, and reversal on prefix-closed languages.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.