Yang Cai
Yang Cai
Home
Publications
Teaching
Short Bio
Students
Contact
Light
Dark
Automatic
A Tight Lower Bound for Streett Complementation
Yang Cai
,
Ting Zhang
January 2011
PDF
DOI
arXiv
Type
Conference paper
Publication
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
"complementation"
"lower bounds"
"omega-automata"
"Streett automata"
Yang Cai
Associate Professor
Related
Tight Upper Bounds for Streett and Parity Complementation
An Improved Lower Bound for the Complementation of Rabin Automata
Cite
×