Skip to main content
Springer Nature Link
Log in

Determinization of Büchi-Automata

  • Chapter
  • First Online:
Automata Logics, and Infinite Games

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

Abstract

To determinize Büchi automata it is necessary to switch to another class of ω-automata, e.g. Muller or Rabin automata. The reason is that there exist languages which are accepted by some nondeterministic Büchi-automaton, but not by any deterministic Büchi-automaton (c.f. section 3.1).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Bremen Institute for Safe Systems, Bremen University, Germany

    Markus Roggenbach

Authors
  1. Markus Roggenbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Universität Kiel, Christian-Albrechts-Platz 4, 24118, Kiel, Germany

    Thomas Wilke

  2. Mathematische Grundlagen der Informatik, RWTH Aachen, 52056, Aachen, Germany

    Erich Grädel

  3. Lehrstuhl Informatik VII, RWTH Aachen, 52056, Aachen, Germany

    Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Roggenbach, M. (2002). Determinization of Büchi-Automata. In: Grädel, E., Thomas, W., Wilke, T. (eds) Automata Logics, and Infinite Games. Lecture Notes in Computer Science, vol 2500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36387-4_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-36387-4_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00388-5

  • Online ISBN: 978-3-540-36387-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation