Abstract
We investigate the topological complexity of non Borel recognizable
tree languages with regard to the difference hierarchy of analytic sets. We
show that, for each integer n ⩾ 1, there is a D
Select search scope: search across all journals or within the current journal
We investigate the topological complexity of non Borel recognizable
tree languages with regard to the difference hierarchy of analytic sets. We
show that, for each integer n ⩾ 1, there is a D