The Wadge Hierarchy of Deterministic Tree Languages
Logic in Computer Science
2015-07-01 v2
Abstract
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.
Cite
@article{arxiv.0812.1729,
title = {The Wadge Hierarchy of Deterministic Tree Languages},
author = {Filip Murlak},
journal= {arXiv preprint arXiv:0812.1729},
year = {2015}
}
Comments
44 pages, 8 figures; extended abstract presented at ICALP 2006, Venice, Italy; full version appears in LMCS special issue