Skip to main content
SpringerLink
Log in

On Deciding if Deterministic Rabin Language Is in Büchi Class

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2000)

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

Included in the following conference series:

Abstract

In this paper we give a proof that it is decidable for a deterministic tree automaton on infinite trees with Rabin acceptance condition, if there exists an equivalent nondeterministic automaton with Büchi acceptance condition. In order to prove this we transform an arbitrary deterministic Rabin automaton to a certain canonical form. Using this canonical form we are able to say if there exists a Büchi automaton equivalent to the initial one. Moreover, if it is the case, the canonical form allows us also to find a respective Büchi automaton.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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: Logic, Methodology and Philosophy of Science, Proc. (1960) International Congr. (1962), 1–11.

    Google Scholar 

  2. An.A. Muchnik Igry na bieskoniecznych dieriewiach i awtomaty s tupikami. Nowoje dokazatielstwo razrieszimosti monadiczieskoj tieorii dwuch sliedowanij, in: Siemiotika (1985), 16–40.

    Google Scholar 

  3. D. Niwiński Fixed point characterization of infinite behavior of finite-state systems, Fundamental Study, Theoretical Computer Science 189 Elsevier (1997), 1–69.

    Google Scholar 

  4. D. Niwiński I. Walukiewicz Relating hierarchies of word and tree automata, Proceedings of “15th Annual Symposium on Theoretical Aspects of Computer Science” (STACS), Paris, France (1998), 320–331.

    Google Scholar 

  5. M.O. Rabin Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141, (1969), 1–35.

    Article  MATH  MathSciNet  Google Scholar 

  6. W. Thomas Automata on infinite objects, in: Handbook of Theoretical Computer Science, Elsevier (1990) 133–191.

    Google Scholar 

  7. W. Thomas Languages, automata and logic, Handbook of Formal Languages, Vol. 3, Springer-Verlag (1997).

    Google Scholar 

  8. T. Wilke, H. Yoo Computing the Rabin index of a regular language of infinite words, Information and Computation Vol. 130 (1996), 61–70.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. Otto, Eliminating Recursion in the mu-Calculus, in: Proceedings of STACS’99, LNCS 1563, Springer 1999, 531–540.

    Google Scholar 

  10. T.F. Urbański, On decidability of some properties of finite automata on infinite trees, Master of Sci. Thesis, Warsaw University, 1998 (in Polish), English version http://zls.mimuw.edu.pl/niwinski/Prace/TU.ps.gz.

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Warsaw, ul.Banacha 2, 02-097, Warsaw, Poland

    Tomasz Fryderyk Urbański

Authors
  1. Tomasz Fryderyk Urbański
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Sciences, University of Pisa, Corso Italia, 40, 56125, Pisa, Italy

    Ugo Montanari

  2. Center for Computer Sciences, University of Geneva, 24, Rue Général Dufour, 1211, Geneva 4, Switzerland

    José D. P. Rolim

  3. Department of Computer Sciences, ETH Zurich, 8092, Zurich, Switzerland

    Emo Welzl

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Urbański, T.F. (2000). On Deciding if Deterministic Rabin Language Is in Büchi Class. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-45022-X_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67715-4

  • Online ISBN: 978-3-540-45022-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation