The Wadge Hierarchy of Deterministic Tree Languages
classification
💻 cs.LO
keywords
hierarchydeterministiclanguagestreetreeswadgeanothercase
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.