Yang Cai
Yang Cai
Home
Publications
Teaching
Short Bio
Students
Contact
Light
Dark
Automatic
Tight Upper Bounds for Streett and Parity Complementation
Yang Cai
,
Ting Zhang
January 2011
PDF
DOI
arXiv
Type
Conference paper
Publication
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL
"complementation"
"omega-automata"
"parity automata"
"Streett automata"
"upper bounds"
Yang Cai
Associate Professor
Related
A Tight Lower Bound for Streett Complementation
An Improved Lower Bound for the Complementation of Rabin Automata
Cite
×