Skip to main content
Conference Proceedings

The wadge hierarchy of deterministic tree languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4052 LNCS 408-419
DOI: 10.1007/11787006_35
8Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We provide a complete description of the Wadge hierarchy for deter-ministically 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 w-regular languages to the case of trees. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Murlak, F. (2006). The wadge hierarchy of deterministic tree languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4052 LNCS, pp. 408–419). Springer Verlag. https://doi.org/10.1007/11787006_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free