2000 character limit reached
Deciding the Borel complexity of regular tree languages
Published 14 Mar 2014 in cs.LO, cs.FL, and math.LO | (1403.3502v1)
Abstract: We show that it is decidable whether a given a regular tree language belongs to the class ${\bf \Delta0_2}$ of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
