Abstract
We show that it is decidable whether a given a regular tree language belongs to the class of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.