2000 character limit reached
Operations on Automata with All States Final (1405.5603v1)
Published 22 May 2014 in cs.FL
Abstract: 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.