]. A. Arn83 and . Arnold, Topological Characterizations of Infinite Behaviours of Transition Systems, Automata, Languages and Programming, Lecture Notes in Computer Science, pp.28-38, 1983.

[. Autebert, J. Berstel, and L. Boasson, Context-Free Languages and Pushdown Automata, Handbook of Formal Languages, 1996.
DOI : 10.1007/978-3-642-59136-5_3

URL : https://hal.archives-ouvertes.fr/hal-00620669

J. Duparc, Abstract, The Journal of Symbolic Logic, vol.1333, issue.01, pp.56-86, 2001.
DOI : 10.2307/1971035

J. Duparc and O. Finkel, An ?-Power of a Context-Free Language Which Is Borel Above ? 0 ?, the Proceedings of the International Conference Foundations of the Formal Sciences V : Infinite Games College Publications at King's College, pp.109-122, 2004.
URL : https://hal.archives-ouvertes.fr/ensl-00147245

]. O. Fin01 and . Finkel, Topological Properties of Omega Context Free Languages, Theoretical Computer Science, vol.262, issue.12, pp.669-697, 2001.

]. O. Fin03 and . Finkel, Borel Hierarchy and Omega Context Free Languages, Theoretical Computer Science, vol.290, issue.3, pp.1385-1405, 2003.

D. [. Finkel and . Lecomte, There Exist Some ??-Powers of Any Borel Rank, the Proceedings of the 16th EACSL Annual Conference on Computer Science and Logic, pp.115-129, 2007.
DOI : 10.1007/978-3-540-74915-8_12

URL : https://hal.archives-ouvertes.fr/ensl-00157204

A. [. Harrington, A. Kechris, . Louveau, and . Glimm, A Glimm-Effros dichotomy for Borel equivalence relations, Effros dichotomy for Borel equivalence relations, pp.903-928, 1990.
DOI : 10.1090/S0894-0347-1990-1057041-5

J. E. Hopcroft and J. D. Ullman, Formal Languages and their Relation to Automata, 1969.

S. Borel, The Journal of Symbolic Logic, pp.915-920, 1989.

]. D. Lec01 and . Lecomte, Sur les Ensembles de Phrases Infinies Constructibles a Partir d'un Dictionnaire sur un Alphabet Fini, Séminaire d'Initiation a l'Analyse, 2001.

]. D. Lec05 and . Lecomte, Omega-Powers and Descriptive Set Theory, Journal of Symbolic Logic, vol.70, issue.4, pp.1210-1232, 2005.

W. [. Lescow and . Thomas, A Decade of Concurrency, Logical Specifications of Infinite Computations, pp.583-621, 1994.

]. A. Lou80 and . Louveau, A Separation Theorem for ? 1

]. D. Niw90 and . Niwinski, Problem on ?-Powers posed in the Proceedings of the 1990 Workshop " Logics and Recognizable Sets

J. [. Perrin and . Pin, Infinite Words, Automata, Semigroups, Logic and Games, Pure and Applied Mathematics, vol.141, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00112831

]. P. Sim92 and . Simonnet, Automates et Théorie Descriptive, 1992.

]. L. Sta86 and . Staiger, Hierarchies of Recursive ?-Languages, Jour. Inform. Process. Cybernetics EIK, vol.226, issue.5, pp.219-241, 1986.

]. L. Sta97b and . Staiger, On ?-Power Languages, in New Trends in Formal Languages, Control, Cooperation, and Combinatorics, Lecture Notes in Computer Science, vol.1218, pp.377-393, 1997.

]. W. Tho90 and . Thomas, Automata on Infinite Objects, Handbook of Theoretical Computer Science, vol.B, pp.133-191, 1990.

]. F. [-ven and . Van-engelen, On Borel Ideals, Annals of Pure and Applied Logic, pp.177-203, 1994.