Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CORR
2008
Springer

favoriteEmaildiscussreport

65views Education» more CORR 2008»

The Wadge Hierarchy of Deterministic Tree Languages

13 years 4 months ago

The Wadge Hierarchy of Deterministic Tree Languages

Download www.mimuw.edu.pl

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.

Filip Murlak

Real-time Traffic

CORR 2008 | Education | Infinite Trees | Recognizable Sets | Wadge Hierarchy |

claim paper

Related Content

» On the Topological Complexity of Weakly Recognizable Tree Languages

» Linear Game Automata Decidable Hierarchy Problems for StrippedDown Alternating Tree Automa...

» On Deciding Topological Classes of Deterministic Tree Languages

» The Generating Power of Total Deterministic Tree Transducers

» A Combinatorial Theorem for Trees

» RegReg a Lightweight Generator of Robust Parsers for Irregular Languages

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Filip Murlak

Comments (0)