Skip to main content
SpringerLink
Log in

The Wadge Hierarchy of Deterministic Tree Languages

  • Conference paper
Automata, Languages and Programming (ICALP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4052))

Included in the following conference series:

Abstract

We provide a complete description of the Wadge hierarchy for deterministically recognizable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to another. This extends Wagner’s results on the hierarchy of ω-regular languages to the case of trees.

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
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.

Similar content being viewed by others

References

  1. Duparc, J.: A hierarchy of deterministic context-free ω-languages. Theoret. Comput. Sci. 290, 1253–1300 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Finkel, O.: Wadge Hierarchy of Omega Context Free Languages. Theoret. Comput. Sci. 269, 283–315 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Kechris, A.S.: Classical Descriptive Set Theory. Graduate Texts in Mathematics 156 (1995)

    Google Scholar 

  4. Kupferman, O., Safra, S., Vardi, M.: Relating Word and Tree Automata. 11th IEEE Symp. on Logic in Comput. Sci, 322–332 (1996)

    Google Scholar 

  5. Murlak, F.: On deciding topological classes of deterministic tree languages. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 428–441. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. F. Murlak. The Wadge hierarchy of deterministic tree languages. Draft version, http://www.mimuw.edu.pl/~fmurlak/papers/conred.pdf

  7. Niwiński, D., Walukiewicz, I.: Relating hierarchies of word and tree automata. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 320–331. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Niwiński, D., Walukiewicz, I.: A gap property of deterministic tree languages. Theoret. Comput. Sci. 303, 215–231 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Niwiński, D., Walukiewicz, I.: Deciding nondeterministic hierarchy of deterministic tree automata. In: Proc. WoLLiC 2004. Electronic Notes in Theoret. Comp. Sci, pp. 195–208 (2005)

    Google Scholar 

  10. Perrin, D., Pin, J.-E.: Infinite Words. Automata, Semigroups, Logic and Games. In: Pure and Applied Mathematics, vol. 141, Elsevier, Amsterdam (2004)

    Google Scholar 

  11. Selivanov, V.: Wadge Degrees of ω-languages of deterministic Turing machines. Theoret. Informatics Appl. 37, 67–83 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Skurczyński, J.: The Borel hierarchy is infinite in the class of regular sets of trees. Theoret. Comput. Sci. 112, 413–418 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  13. Urbański, T.F.: On deciding if deterministic Rabin language is in Büchi class. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 663–674. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Wagner, K.: Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. EIK 13, 473–487 (1977)

    MATH  Google Scholar 

  15. Wagner, K.: On ω-regular sets. Inform. and Control 43, 123–177 (1979)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, ul. Banacha 2, 02–097, Warszawa, Poland

    Filip Murlak

Authors
  1. Filip Murlak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università Ca’ Foscari, Venice,  

    Michele Bugliesi

  2. Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    Bart Preneel

  3. ECS, University of Southampton, UK

    Vladimiro Sassone

  4. FB Informatik, LS2, Univ. Dortmund, 44221, Dortmund, Germany

    Ingo Wegener

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Murlak, F. (2006). The Wadge Hierarchy of Deterministic Tree Languages. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787006_35

Download citation

  • DOI: https://doi.org/10.1007/11787006_35

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation