An improved lower bound for the complementation of Rabin automata
Name
Yang-2009-An improved lower bound for the complementation of Rabin automata.pdf
Size
282.14 KB
Format
Adobe PDF
Checksum (MD5)
208012d581f4a1f667287869df277e00
Author(s)
Cai, Yang
Zhang, Ting
Luo, Haifeng
Date Issued
September 2009
Journal
24th Annual IEEE Symposium on Logic In Computer Science, 2009. LICS '09.
Publisher
Institute of Electrical and Electronics Engineers
Citation
Yang Cai, Ting Zhang, and Haifeng Luo. “An Improved Lower Bound for the Complementation of Rabin Automata.” Logic In Computer Science, 2009. LICS '09. 24th Annual IEEE Symposium on. 2009. 167-176. © 2009 IEEE
Version
Final published version
Abstract
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 complexity of the complementation problem. However, obtaining nontrivial lower bounds has been difficult. For the complementation of Rabin automata, a significant gap exists between the state-of-the-art lower bound 2[superscript Omega(NlgN)] and upper bound 2[superscript O(kNlgN)], where k, the number of Rabin pairs, can be as large as 2[superscript N]. In this paper we introduce multidimensional rankings to the full automata technique. Using the improved technique we establish an almost tight lower bound for the complementation of Rabin automata. We also show that the same lower bound holds for the determinization of Rabin automata.
Subjects
Rabin automata
complementation
determinization
full automata
omega-automata
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/LICS.2009.13
