"Upper bound"

An Improved Lower Bound for the Complementation of Rabin Automata
Automata on infinite words ($\omega$-automata) have wide applications in formal language theory as well as in modeling and verifying …
PDF DOI