Operations on Automata with All States Final
Kristína Čevorová, Galina Jirásková, Peter Mlynárčik, Matúš Palmovský, Juraj Šebej · Electronic Proceedings in Theoretical Computer Science · 2014
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.