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, Zhang, Ting, Luo, Haifeng
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers 2010
Subjects:
Rabin automata
complementation
determinization
full automata
omega-automata
Online Access:http://hdl.handle.net/1721.1/58827

Internet

http://hdl.handle.net/1721.1/58827

Similar Items