R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

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

O. [. Carton, P. Finkel, and . Simonnet, On the continuity set of an Omega rational function, Theoretical Informatics and Applications, pp.183-196, 2008.
DOI : 10.1051/ita:2007050

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

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

URL : http://doi.org/10.1016/0304-3975(78)90002-6

J. [. Cenzer, Index sets for ??-languages, MLQ, vol.49, issue.1, pp.22-33, 2003.
DOI : 10.1002/malq.200310002

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

]. O. Fin06a and . Finkel, Borel ranks and Wadge degrees of omega context free languages, Mathematical Structures in Computer Science, vol.16, issue.5, pp.813-840, 2006.

]. O. Fin06b and . Finkel, On the accepting power of two-tape Büchi automata, Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science, STACS 2006, pp.301-312, 2006.

]. O. Fin06c and . Finkel, Undecidable problems about timed automata, Proceedings of the 4th International Conference on Formal Modeling and Analysis of Timed Systems, pp.187-199, 2006.

]. O. Fin09 and . Finkel, Highly undecidable problems for infinite computations, Theoretical Informatics and Applications, pp.339-364, 2009.

D. [. Finkel, . Lecomtefs00-]-r, L. Freund, and . Staiger, Decision problems for Turing machines Acceptance of ?-languages by communicating deterministic Turing machines, Words, Sequences, Grammars, Languages: where Biology, pp.23-241223, 2000.

F. Gire, Two decidability problems for infinite words, Information Processing Letters, vol.22, issue.3, pp.135-140, 1986.
DOI : 10.1016/0020-0190(86)90058-X

]. D. Har86 and . Harel, Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness, Journal of the ACM, vol.33, issue.1, pp.224-248, 1986.

T. [. Halava and . Harju, Undecidability of infinite post correspondence problem for instances of Size 9, Theoretical Informatics and Applications, pp.551-557, 2006.
DOI : 10.1051/ita:2006039

T. [. Halava, J. Harju, and . Karhumäki, Undecidability in omegaregular languages, Fundamamenta Informaticae, vol.73, issue.12, pp.119-125, 2006.

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and computation, 2001.
DOI : 10.1145/568438.568455

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

W. [. Lescow and . Thomas, Logical specifications of infinite computations, Lecture Notes in Computer Science, vol.803, pp.583-621, 1994.

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

]. C. Pri01 and . Prieur, How to decide continuity of rational functions on infinite words How to decide continuity of rational functions on infinite words, Pri02] C. Prieur, pp.71-82445, 2001.

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

]. K. Ruo85 and . Ruohonen, Reversible machines and Post's correspondence problem for biprefix morphisms, Elektronische Informationsverarbeitung und Kybernetik, vol.21, issue.12, pp.579-595, 1985.

]. G. Sén01 and . Sénizergues, L(A)=L(B)? decidability results from complete formal systems, Theoretical Computer Science, vol.251, issue.12, pp.1-166, 2001.

]. L. Sta93 and . Staiger, Recursive automata on infinite words, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science , STACS 93, pp.629-639, 1993.

]. L. Sta97 and . Staiger, ?-languages, Handbook of formal languages, pp.339-387, 1997.

L. Staiger, On the power of reading the whole infinite input tape In Finite Versus Infinite: Contributions to an Eternal Dilemma, pp.335-348, 2000.

L. Staiger and K. Wagner, Rekursive Folgenmengen I, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.22, issue.31-36, pp.523-538, 1978.
DOI : 10.1002/malq.19780243107

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