Some complete $\omega$-powers of a one-counter language, for any Borel class of finite rank

Olivier Finkel, Dominique Lecomte

We prove that, for any natural number n $\ge$ 1, we can find a finite alphabet $\Sigma$ and a finitary language L over $\Sigma$ accepted by a one-counter automaton, such that the $\omega$-power L…