Sciweavers

Share
CORR
2011
Springer
165views Education» more  CORR 2011»
7 years 10 months ago
Tight Upper Bounds for Streett and Parity Complementation
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 problem...
Yang Cai, Ting Zhang
books