"Rabin automata"

Automata on infinite words ($\omega$-automata) have wide applications in formal language theory as well as in modeling and verifying …