The Wadge Hierarchy of Deterministic Tree Languages
Filip Murlak
TL;DR
This paper characterizes the Wadge hierarchy for deterministic infinite tree languages, providing an elementary decision procedure for continuous reducibility, extending known results from omega-regular word languages to trees.
Contribution
It offers a complete description of the Wadge hierarchy for deterministic tree languages and introduces a decision procedure for reducibility between them.
Findings
Complete Wadge hierarchy for deterministic tree languages
Elementary procedure to decide continuous reducibility
Extension of Wagner's hierarchy results from words to trees
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHermeneutics and Narrative Identity · Aging, Elder Care, and Social Issues · Health, Medicine and Society