Deciding the Borel complexity of regular tree languages
Logic in Computer Science
2014-03-17 v1 Formal Languages and Automata Theory
Logic
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.
Cite
@article{arxiv.1403.3502,
title = {Deciding the Borel complexity of regular tree languages},
author = {Alessandro Facchini and Henryk Michalewski},
journal= {arXiv preprint arXiv:1403.3502},
year = {2014}
}
Comments
15 pages, 2 figures