An ω-power of a context-free . . .
We use erasers-like basic operations on words to construct a set that is both Borel and above �, built as a set where is a language of finite words accepted by a pushdown automaton. In particular, this gives a first example of an ω-power of a context free language which is a Borel set of infinite rank
Accepted by the editors
Sorry, we are unable to provide the full text but you may find it at the following location(s):
http://citeseerx.ist.psu.edu/v... (external link)
http://prunel.ccsd.cnrs.fr/doc... (external link)