6 citations · 10 across the 3 of their papers we have counts for
3 papers
cs.LO2011★ 3 cited
Can Nondeterminism Help Complementation?
Yang Cai, Ting Zhang
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…
cs.LO2011★ 6 cited
A Tight Lower Bound for Streett Complementation
Yang Cai, Ting Zhang
Finite automata on infinite words (-automata) proved to be a powerful weapon for modeling and reasoning infinite behaviors of reactive systems. Complementation of -automata i…
cs.LO2011★ 1 cited
Tight Upper Bounds for Streett and Parity Complementation
Yang Cai, Ting Zhang
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problems i…