Computer Science – Logic in Computer Science
Scientific paper
2008-12-09
LMCS 4 (4:15) 2008
Computer Science
Logic in Computer Science
44 pages, 8 figures; extended abstract presented at ICALP 2006, Venice, Italy; full version appears in LMCS special issue
Scientific paper
10.2168/LMCS-4(4:15)2008
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.
No associations
LandOfFree
The Wadge Hierarchy of Deterministic Tree Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Wadge Hierarchy of Deterministic Tree Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Wadge Hierarchy of Deterministic Tree Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-282629