An improved lower bound for the complementation of Rabin automata

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 reactive systems. Complementation of omega-automata is a crucial instrument in many these applications, and hence there have been great interests in determining the state...

Full description

Bibliographic Details
Main Authors: Cai, Yang (Contributor), Zhang, Ting (Author), Luo, Haifeng (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers, 2010-10-01T17:10:18Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items