"omega-automata"

A Tight Lower Bound for Streett Complementation

Yang Cai, Ting Zhang

Tight Upper Bounds for Streett and Parity Complementation

Yang Cai, Ting Zhang

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 …

Yang Cai, Ting Zhang, Haifeng Luo