论文信息 - The Wadge Hierarchy of Deterministic Tree Languages

The Wadge Hierarchy of Deterministic Tree Languages

We provide a complete description of the Wadge hierarchy for deterministically recognisable 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 omega-regular languages of words to the case of trees.

Filip Murlak

[1] Igor Walukiewicz,et al. Deciding Nondeterministic Hierarchy of Deterministic Tree Automata , 2005, Electron. Notes Theor. Comput. Sci..

[2] Jean-Eric Pin,et al. Infinite words - automata, semigroups, logic and games , 2004, Pure and applied mathematics series.

[3] Klaus W. Wagner. Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen , 1977, J. Inf. Process. Cybern..

[4] Damian Niwinski. On Fixed-Point Clones (Extended Abstract) , 1986, ICALP.

[5] Filip Murlak. On Deciding Topological Classes of Deterministic Tree Languages , 2005, CSL.

[6] Igor Walukiewicz,et al. A gap property of deterministic tree languages , 2003, Theor. Comput. Sci..

[7] Tomasz Fryderyk Urbanski. On Deciding if Deterministic Rabin Language Is in Büchi Class , 2000, ICALP.

[8] Igor Walukiewicz,et al. Relating Hierarchies of Word and Tree Automata , 1998, STACS.

[9] Jerzy Skurczynski. The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees , 1993, Theor. Comput. Sci..

[10] Victor L. Selivanov,et al. Wadge degrees of ω-languages of deterministic Turing machines , 2003 .

[11] Olivier Finkel,et al. Wadge hierarchy of omega context-free languages , 2001, Theor. Comput. Sci..

[12] Filip Murlak. The Wadge Hierarchy of Deterministic Tree Languages , 2006, ICALP.