Can Nondeterminism Help Complementation?
Yang Cai,
Ting Zhang
Abstract
Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature. In the case of nondeterministic finite automata on finite words (NFA), complementation and determinization have the same state complexity, namely $\Theta(2^{n})$ where $n$ is the state size. The same similarity between determinization and complementation was found for B\"{u}chi automata, where both operations were shown to have $2^{\Theta(n \lg n)}$ state complexity. Of theoretical interest is whether there exists a type of $\omega$-automata whose determinization is considerably harder than its complementation. In this paper, we show that for all common type $\omega$-automata, the determinization problem has the same state complexity as the corresponding complementation problem at the granularity of $2^{\Theta(\cdot)}$.
Download
LICS 2011 Short Presentation (Slides)
Full Version (PDF)
Other Formats on arXiv
Conference Presentation (PDF)