A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Borel ranks and Wadge degrees of context free $\omega$-languages

2006
*
Mathematical Structures in Computer Science
*

We show that the Borel hierarchy of the class of context free ω-languages, or even of the class of ω-languages accepted by Büchi 1-counter automata, is the same as the Borel hierarchy of the class of ω-languages accepted by Turing machines with a Büchi acceptance condition. In particular, for each recursive non null ordinal α, there exist some Σ 0 α -complete and some Π 0 α -complete ω-languages accepted by Büchi 1counter automata. And the supremum of the set of Borel ranks of context free

doi:10.1017/s0960129506005597
fatcat:g3jri3nlt5aurozzy5neishngy