Deciding the Borel complexity of regular tree languages
Abstract
We show that it is decidable whether a given a regular tree language belongs to the class 02 of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.