J. 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. Altenbernd, W. Thomas, S. Wöhrle, A. Ballier, and E. Jeandel, Tiling Systems over Infinite Pictures and Their Acceptance Conditions, Proceedings of the 6th International Conference Developments in Language Theory Proceedings of the Journées Automates Cellulaires, pp.297-306, 2002.
DOI : 10.1007/3-540-45005-X_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.9068

J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, Proceedings of the 1960 International Congress on Logic Methodology and Philosophy of Science, pp.1-11, 1962.
DOI : 10.1007/978-1-4613-8928-6_23

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

J. Engelfriet and H. J. Hoogeboom, X-automata on ??-words, Theoretical Computer Science, vol.110, issue.1, pp.1-51, 1993.
DOI : 10.1016/0304-3975(93)90349-X

F. Gire, Relations rationnelles infinitaires, Calcolo, vol.18, issue.2, 1981.
DOI : 10.1007/BF02575909

F. Gire and M. Nivat, Relations rationnelles infinitaires. Calcolo, pp.91-125, 1984.

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

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and computation, Series in Computer Science. [Jec02] T. Jech. Set theory, 1997.
DOI : 10.1145/568438.568455

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

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

L. H. Landweber, W. Lescow, and . Thomas, Decision problems for ?-automata Logical specifications of infinite computations, Decade of Concurrency, pp.376-384, 1969.

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

P. G. Odifreddi, Infinite words, automata, semigroups, logic and games, of Studies in Logic and the Foundations of Mathematics, 1999.

]. H. Rog67 and . Rogers, Theory of Recursive Functions and Effective Computability, Sacks. Countable admissible ordinals and hyperdegrees. Advances in MathematicsSim92] P. Simonnet. Automates et théorie descriptive, pp.213-262, 1967.

L. Staiger, Hierarchies of recursive ?-languages, Elektronische Informationsverarbeitung und Kybernetik, vol.22, issue.5-6, pp.219-241, 1986.

L. Staiger, Research in the theory of ?-languages, Journal of Information Processing and Cybernetics, vol.23, issue.8- 9, pp.415-439, 1987.

L. Staigertho90 and ]. W. Thomas, Automata on infinite objects, Handbook of formal languages Formal models and semantics, pp.339-387, 1990.