M. Anselmo, D. Giammarresi, M. Madonia, and A. Restivo, Unambiguous recognizable two-dimensional languages, Theoretical Informatics and Applications, pp.277-293, 2006.
DOI : 10.1051/ita:2006008

J. Altenbernd, W. Thomas, and S. Wöhrle, Tiling Systems over Infinite Pictures and Their Acceptance Conditions, Proceedings of the 6th International Conference Developments in Language Theory , DLT 2002, pp.297-306, 2003.
DOI : 10.1007/3-540-45005-X_26

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.9068

J. Castro and F. Cucker, Nondeterministic ??-Computations and the Analytical Hierarchy, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.24, issue.4, pp.333-342, 1989.
DOI : 10.1002/malq.19890350406

A. [. Cohen and . Gold, ??-Computations on Turing machines, Theoretical Computer Science, vol.6, issue.1, pp.1-23, 1978.
DOI : 10.1016/0304-3975(78)90002-6

]. O. Fin09b and . Finkel, Highly undecidable problems about recognizability by tiling systems, Fundamenta Informaticae, vol.91, issue.2, pp.305-323, 2009.

O. Finkel and D. Lecomte, Decision problems for Turing machines, Information Processing Letters, vol.109, issue.23-24, pp.23-241223, 2009.
DOI : 10.1016/j.ipl.2009.09.002

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

O. Finkel and P. Simonnet, On recognizable tree languages beyond the Borel hierarchy, Fundamenta Informaticae, vol.95, issue.23, pp.287-303, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00412638

A. [. Giammarresi and . Restivo, Two-Dimensional Languages, Handbook of formal languages, pp.215-267, 1997.
DOI : 10.1007/978-3-642-59126-6_4

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

]. D. Gua73 and . Guaspari, Thin and well ordered analytical sets, 1973.

A. [. Harrington, A. Kechris, and . Louveau, A Glimm-Effros dichotomy for Borel equivalence relations, Journal of the American Mathematical Society, vol.3, issue.4, pp.903-928, 1990.
DOI : 10.1090/S0894-0347-1990-1057041-5

]. T. Jec02 and . Jech, Set theory, third edition, 2002.

]. A. Kan97 and . Kanamori, The Higher Infinite, 1997.

]. A. Kec75 and . Kechris, The theory of countable analytical sets. Transactions of the, pp.259-297, 1975.

]. A. Kec95 and . Kechris, Classical descriptive set theory, 1995.

W. [. Lescow and . Thomas, Logical specifications of infinite computations, Decade of Concurrency, pp.583-621, 1994.

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

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

H. Rogers, Theory of Recursive Functions and Effective Computability, 1967.

]. G. Sac76 and . Sacks, Countable admissible ordinals and hyperdegrees, Advances in Mathematics, vol.171, pp.213-262, 1976.

]. L. Sta86 and . Staiger, Hierarchies of recursive ?-languages, Sta97] L. Staiger. ?-languages. In Handbook of formal languages, pp.5-6219, 1986.

]. W. Tho90 and . Thomas, Automata on infinite objects Handbook of Theoretical Computer Science, volume B, Formal models and semantics, pp.135-191, 1990.