D. Lecomte, Abstract, The Journal of Symbolic Logic, vol.3, issue.04, pp.1210-1232, 2005.
DOI : 10.1090/S0002-9939-97-03770-2
URL : https://hal.archives-ouvertes.fr/ensl-00319447

L. Staiger, ??-Languages, pp.339-387, 1997.
DOI : 10.1007/978-3-642-59126-6_6

D. Niwinski, A problem on ?-powers, Workshop on Logics and Recognizable Sets, 1990.

P. Simonnet, Automates et théorie descriptive, 1992.

L. Staiger, On ??-power languages, Lecture Notes in Computer Science, vol.1218, pp.377-393, 1997.
DOI : 10.1007/3-540-62844-4_27

J. Duparc and O. Finkel, An ?-power of a context free language which is Borel above ? 0 ?, Proceedings of the International Conference Foundations of the Formal Sciences V : Infinite Games Studies in Logic, College Publications at King's College, pp.109-122, 2004.
URL : https://hal.archives-ouvertes.fr/ensl-00147245

O. Finkel and D. Lecomte, There Exist Some ??-Powers of Any Borel Rank, Proceedings of the 16th EACSL Annual International Conference on Computer Science and Logic, CSL 2007, pp.115-129, 2007.
DOI : 10.1007/978-3-540-74915-8_12
URL : https://hal.archives-ouvertes.fr/ensl-00157204

O. Finkel and D. Lecomte, Classical and effective descriptive complexities of <mml:math altimg="si2.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-powers, Annals of Pure and Applied Logic, vol.160, issue.2, pp.163-191, 2009.
DOI : 10.1016/j.apal.2009.02.005

W. Thomas, Automata on Infinite Objects, pp.135-191, 1990.
DOI : 10.1016/B978-0-444-88074-1.50009-3

Y. N. Moschovakis, Descriptive set theory, 1980.
DOI : 10.1090/surv/155

H. Lescow and W. Thomas, Logical specifications of infinite computations, in: A Decade of Concurrency, Lecture Notes in Computer Science, vol.803, pp.583-621, 1994.

A. S. Kechris, Classical descriptive set theory, 1995.
DOI : 10.1007/978-1-4612-4190-4

D. Perrin and J. E. Pin, Infinite words, automata, semigroups, logic and games, Pure and Applied Mathematics, vol.141, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00112831

W. Wadge, Reducibility and determinateness in the Baire space, 1983.

J. M. Autebert, J. Berstel, and L. Boasson, Context-Free Languages and Pushdown Automata, 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