Paper Info
Title
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 ${\bf \Delta^0_2}$ of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.
Year
DOI
Venue
2014
10.1007/978-3-319-08019-2_17
CiE
DocType
Volume
Citations 
Journal
abs/1403.3502
1
PageRank 
References 
Authors
0.35
12
2
Name
Order
Citations
PageRank
Alessandro Facchini1359.47
Henryk Michalewski24012.07