MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

An improved lower bound for the complementation of Rabin automata

Author(s)
Cai, Yang; Zhang, Ting; Luo, Haifeng
Thumbnail
DownloadYang-2009-An improved lower bound for the complementation of Rabin automata.pdf (282.1Kb)
PUBLISHER_POLICY

Publisher Policy

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.

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.
Metadata
Show full item record
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.
Date issued
2009-09
URI
http://hdl.handle.net/1721.1/58827
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
Other identifiers
INSPEC Accession Number: 10866865
ISBN
978-0-7695-3746-7
ISSN
1043-6871
Keywords
Rabin automata, complementation, determinization, full automata, omega-automata

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.