Skip to main content
SpringerLink
Log in

Optimal Bounds for Transformations of ω-Automata

  • Conference paper
  • First Online:
Book cover Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1738))

Abstract

In this paper we settle the complexity of some basic constructions of ω-automata theory, concerning transformations of automata characterizing the set of ω-regular languages. In particular we consider Safra’s construction (for the conversion of nondeterministic Büchi automata into deterministic Rabin automata) and the appearance record constructions (for the transformation between different models of deterministic automata with various acceptance conditions). Extending results of Michel (1988) and Dziembowski, Jurdziński, and Walukiewicz (1997), we obtain sharplo wer bounds on the size of the constructed automata.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. International Congress on Logic, Method and Philos. Sci. 1960, pages 1–11, 1962. 97, 99

    Google Scholar 

  2. J.R. Büchi. Winning state-strategies for boolean-F σ games. manuscript, 1981. 97, 98, 103

    Google Scholar 

  3. J.R. Büchi. State-strategies for games in F σδ ∩ G δσ. Journal of Symbolic Logic, 48(4):1171–1198, December 1983. 97, 98, 103

    Article  MATH  MathSciNet  Google Scholar 

  4. S. Dziembowski, M. Jurdziński, and I. Walukiewicz. How much memory is needed to win infinite games? In Proc. IEEE, LICS, 1997. 97, 98, 104, 104, 104

    Google Scholar 

  5. Y. Gurevich and L. Harrington. Trees, automata and games. In Proc. 14th ACM Symp. on the Theory of Computing, pages 60–65, 1982. 97, 98, 103

    Google Scholar 

  6. S. Krishnan, A. Puri, and R. Brayton. Structural complexity of ω-automata. In 12th Annual Symposium on Theoretical Aspects of Computer Science, volume 900 of Lecture Notes in Computer Science, pages 143–156. Springer, 1995. 106, 106

    Google Scholar 

  7. L.H. Landweber. Decision problems for ω-automata. Math. System Theory, 3:376–384, 1969. 103

    Article  MATH  MathSciNet  Google Scholar 

  8. C. Löding. Methods for the transformation of ω-automata: Complexity and connection to second order logic. Master’s thesis, Christian-Albrechts-University of Kiel, 1998. 98

    Google Scholar 

  9. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521–530, 1966. 97

    Article  MATH  MathSciNet  Google Scholar 

  10. M. Michel. Complementation is much more difficult with automata on infinite words. Manuscript,CNET, Paris, 1988. 97, 97

    Google Scholar 

  11. A.W. Mostowski. Regular expressions for infinite trees and a standard form of automata. Lecture Notes in Computer Science, 208:157–168, 1984. 97, 99

    Google Scholar 

  12. D.E. Muller. Infinite sequences and finite machines. In Proc. 4th IEEE Symposium on Switching Circuit Theory and Logical design, pages 3–16, 1963. 97, 99

    Google Scholar 

  13. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1–35, 1969. 97, 99

    Article  MATH  MathSciNet  Google Scholar 

  14. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319–327, 1988. 97, 97, 100

    Google Scholar 

  15. S. Safra. Exponential determinization for ω-automata with strong-fairness acceptance condition. In Proc. 24th ACM Symp. on the Theory of Computing, pages 275–282, 1992. 103

    Google Scholar 

  16. S. Safra and M. Y. Vardi. On ω-automata and temporal logic. In Proc. 21th ACM Symp. on the Theory of Computing, 1989. 103

    Google Scholar 

  17. R.S. Streett. Propositional dynamic logic of looping and converse is elementary decidable. Information and Control, 54:121–141, 1982. 97, 99

    Article  MATH  MathSciNet  Google Scholar 

  18. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III, pages 385–455. Springer-Verlag, 1997. 98, 101, 102, 102, 103

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik VII, RWTH Aachen, D-52056, Aachen

    Christof Löding

Authors
  1. Christof Löding
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Chennai, 600036, India

    C. Pandu Rangan

  2. Institute of Mathematical Sciences C.I.T. Campus, Chennai, 600113, India

    V. Raman  & R. Ramanujam  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Löding, C. (1999). Optimal Bounds for Transformations of ω-Automata. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-46691-6_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66836-7

  • Online ISBN: 978-3-540-46691-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation