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, Automata, Semigroups and Recognizability of Words on Ordinals, International Journal of Algebra and Computation, vol.08, issue.01, pp.1-21, 1998.
DOI : 10.1142/S0218196798000028
URL : https://hal.archives-ouvertes.fr/hal-00619361

N. Bedon, Star-Free Sets of Words on Ordinals, Information and Computation, vol.166, issue.2, pp.93-111, 2001.
DOI : 10.1006/inco.2000.3009
URL : https://hal.archives-ouvertes.fr/hal-00619360

N. Bedon and O. Carton, An Eilenberg theorem for words on countable ordinals, Latin'98: Theoretical Informatics, pp.53-64, 1998.
DOI : 10.1007/BFb0054310
URL : https://hal.archives-ouvertes.fr/hal-00619872

V. Bruyère and O. Carton, Automata on Linear Orderings, Lect. Notes in Comput. Sci, vol.2136, pp.236-247, 2001.
DOI : 10.1007/3-540-44683-4_21

V. Bruyère, O. Carton, and G. Sénizergues, Tree Automata and Automata on Linear Orderings, RAIRO - Theoretical Informatics and Applications, vol.43, issue.2, pp.222-231, 2003.
DOI : 10.1051/ita/2009009

J. R. Büchi, Weak Second-Order Arithmetic and Finite Automata, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.9, issue.1-6, pp.66-92, 1960.
DOI : 10.1002/malq.19600060105

J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, Proc. Int. Congress Logic, pp.1-11, 1960.
DOI : 10.1007/978-1-4613-8928-6_23

J. R. Büchi, Decision methods in the theory of ordinals, Bulletin of the American Mathematical Society, vol.71, issue.5, pp.767-770, 1965.
DOI : 10.1090/S0002-9904-1965-11384-2

O. Carton and M. Michel, Unambiguous B??chi automata, Theoretical Computer Science, vol.297, issue.1-3, pp.37-81
DOI : 10.1016/S0304-3975(02)00618-7

O. Carton and C. , Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank, Lect. Notes in Comput. Sci, vol.2976, pp.292-301, 2004.
DOI : 10.1007/978-3-540-24698-5_33
URL : https://hal.archives-ouvertes.fr/hal-00619905

D. Girault-beauquier, Bilimites de langages reconnaissables, Theoretical Computer Science, vol.33, issue.2-3, pp.335-342, 1984.
DOI : 10.1016/0304-3975(84)90095-1
URL : http://doi.org/10.1016/0304-3975(84)90095-1

F. Hausdorff, Set Theory, 1957.

S. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, Automata studies, pp.3-41, 1956.
DOI : 10.1515/9781400882618-002

R. Mcnaughton, Testing and generating infinite sequences by a finite automaton, Information and Control, vol.9, issue.5, pp.521-530, 1966.
DOI : 10.1016/S0019-9958(66)80013-X

R. Mcnaughton and S. Papert, Counter free automata, 1971.

D. Muller, Infinite sequences and finite machines, Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design (swct 1963), pp.3-16, 1963.
DOI : 10.1109/SWCT.1963.8

M. Nivat and D. Perrin, Ensembles reconnaissables de mots bi-infinis, Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp.47-59, 1982.
DOI : 10.1145/800070.802176

J. Pécuchet, Varietes de Semis Groupes et Mots Infinis, STACS'86, pp.180-191, 1986.
DOI : 10.1007/3-540-16078-7_75

M. O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc, vol.141, pp.1-35, 1969.

F. P. Ramsey, On a problem on formal logic, Proc. London Math. Soc, vol.30, issue.2, pp.264-286, 1929.

J. G. Rosenstein, Linear Orderings, 1982.

M. Schützenberger, On finite monoids having only trivial subgroups, Information and Control, vol.8, issue.2, pp.190-194, 1965.
DOI : 10.1016/S0019-9958(65)90108-7