Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones 英文论文文献.docVIP

UnambiguousTreeLanguagesAreTopologicallyHarder ThanDeterministicOnes SzczepanHummel? InstituteofInformatics,UniversityofWarsaw ThepapergivesanexampleofatreelanguageGthatisrecognisedbyanunambiguousparityau- tomatonandisΣ1-complete(analytic-complete)asasetinCantorspace.Thisalreadyshowsthatthe 1 unambiguouslanguagesaretopologicallymorecomplexthanthedeterministicones,thatareallin Π11. Using set G as a building block we construct an unambiguous language that is topologically harder than any countable boolean combination of Σ1 and Π1 sets. In particular the language is 1 1 harderthananysetindiffer