Filip Murlak - The Wadge Hierarchy of Deterministic Tree Languages

lmcs:994 - Logical Methods in Computer Science, December 23, 2008, Volume 4, Issue 4 - https://doi.org/10.2168/LMCS-4(4:15)2008
The Wadge Hierarchy of Deterministic Tree LanguagesArticle

Authors: Filip Murlak ORCID

    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.

    https://doi.org/10.2168/LMCS-4(4:15)2008
    Source: arXiv.org:0812.1729
    Volume: Volume 4, Issue 4
    Published on: December 23, 2008
    Imported on: November 2, 2006
    Keywords: Computer Science - Logic in Computer Science,F.4.3,F.4.1,F.1.1,F.1.3
    Licence: arXiv.org - Non-exclusive license to distribute

    5 Documents citing this article

    Share and export

    Consultation statistics

    This page has been seen 1515 times.
    This article's PDF has been downloaded 321 times.