N. Bedon, Finite automata and ordinals, Theoretical Computer Science, vol.156, issue.1-2, pp.119-144, 1996.
DOI : 10.1016/0304-3975(95)00006-2
URL : https://hal.archives-ouvertes.fr/hal-00619364

N. Bedon, A. Bés, O. Carton, and C. Rispal, Logic and Rational Languages of Words Indexed by Linear Orderings, Proceedings of the third International Computer Science Symposium in Russia (CSR'08), pp.76-85, 2008.
DOI : 10.1007/978-3-540-79709-8_11
URL : https://hal.archives-ouvertes.fr/hal-00620148

B. Alexis, O. Es, and . Carton, A kleene theorem for languages of words indexed by linear orderings, Proceedings of Developments in Language Theory 2005, pp.158-167, 2005.

L. Boasson, Context-free sets of infinite words, Theoretical Computer Science 4th GI Conference, pp.1-9, 1979.
DOI : 10.1007/3-540-09118-1_1

V. Bruyère and O. Carton, Automata on linear orderings, Journal of Computer and System Sciences, vol.73, issue.1, pp.1-24, 2007.
DOI : 10.1016/j.jcss.2006.10.009

J. and R. Büchi, The monadic second order theory of ??1, Lecture Notes in Mathematics, vol.76, pp.1-127, 1973.
DOI : 10.1007/978-3-662-36678-3

Y. Choueka, Finite automata, definable sets, and regular expressions over ??n-tapes, Journal of Computer and System Sciences, vol.17, issue.1, pp.81-97, 1978.
DOI : 10.1016/0022-0000(78)90036-3
URL : https://doi.org/10.1016/0022-0000(78)90036-3

R. S. Cohen and A. Y. Gold, Theory of ??-languagesI: Characterizations of ??-context-free languages, Journal of Computer and System Sciences, vol.15, issue.2, pp.169-208, 1977.
DOI : 10.1016/S0022-0000(77)80004-4
URL : https://doi.org/10.1016/s0022-0000(77)80004-4

B. Courcelle, Frontiers of infinite trees, RAIRO -Theoretical Informatics and Applications -Informatique Théorique et Applications, pp.319-337, 1978.
DOI : 10.1109/SFCS.1976.9

S. Zoltánzoltán´zoltánésik and . Iván, Büchi context-free languages, Theoretical Computer Science, vol.41210, issue.8, pp.805-821, 2011.

S. Zoltánzoltán´zoltánésik and . Iván, On Müller context-free grammars, Theoretical Computer Science, vol.416, pp.17-32, 2012.

M. Nivat, Sur les ensembles de mots infinis engendr??s par une grammaire alg??brique, Theoretical Informatics and Applications -Informatique Théorique et Applications, pp.259-278, 1978.
DOI : 10.1051/ita/1978120302591

D. Perrin and J. ´. Pin, Infinite Words: Automata, Semigroups, Logic and Games
URL : https://hal.archives-ouvertes.fr/hal-00619830

O. Michael and . Rabin, Decidability of second order theories and automata on infinite trees, Transactions of the AMS, vol.141, pp.1-35, 1969.

J. Wojciechowski, Classes of transfinite sequences accepted by finite automata, Fundamenta Informaticae, vol.7, issue.2, pp.191-223, 1984.

J. Wojciechowski, Finite automata on transfinite sequences and regular expressions, Fundamenta Informaticae, vol.84, issue.3, pp.379-396, 1985.