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, Logic over Words on Denumerable Ordinals, Journal of Computer and System Sciences, vol.63, issue.3, pp.394-431, 2001.
DOI : 10.1006/jcss.2001.1782
URL : https://hal.archives-ouvertes.fr/hal-00619359

V. Bruyère, O. Carton, and G. Sénizergues, Tree Automata and Automata on Linear Orderings, Proceedings of WORDS'03, pp.222-231, 2003.
DOI : 10.1051/ita/2009009

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

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

J. and 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

T. Cachat, Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games, Proceedings of the 30th International Colloquium on Automata , Languages, and Programming, ICALP'03, pp.556-569, 2003.
DOI : 10.1007/3-540-45061-0_45
URL : https://hal.archives-ouvertes.fr/hal-00019874

O. Carton and C. Rispal, Complementation of rational sets on scattered linear orderings of finite rank, LNCS, vol.2976, pp.292-301, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00619905

D. Caucal, On Infinite Terms Having a Decidable Monadic Theory, Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, pp.165-176, 2002.
DOI : 10.1007/3-540-45687-2_13

C. Delhommé, Automaticit?? des ordinaux et des graphes homog??nes, Comptes Rendus Mathematique, vol.339, issue.1, pp.5-10, 2004.
DOI : 10.1016/j.crma.2004.03.035

N. Dershowitz, Trees, ordinals and termination, LNCS, vol.668, pp.243-250, 1993.
DOI : 10.1007/3-540-56610-4_68

F. Klaedtke, On the automata size for Presburger arithmetic A full version of the paper is available from the author's web page, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, pp.110-119, 2004.

O. Kupferman and M. Y. Vardi, An Automata-Theoretic Approach to Reasoning about Infinite-State Systems, Proceedings of the 12th International Conference on Computer Aided Verification, CAV'00, pp.36-52, 2000.
DOI : 10.1007/10722167_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.4661

F. Maurin, Exact complexity bounds for ordinal addition, Theoretical Computer Science, vol.165, issue.2, pp.247-273, 1996.
DOI : 10.1016/0304-3975(95)00221-9
URL : http://doi.org/10.1016/0304-3975(95)00221-9

F. Nießner, Nondeterministic tree automata, Grädel et al. [13], pp.135-152

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

K. Reinhardt, The Complexity of Translating Logic to Finite Automata, Grädel et al. [13], pp.231-238
DOI : 10.1007/3-540-36387-4_13

G. Joseph and . Rosenstein, Linear orderings, 1982.

S. Wac, Cardinal and ordinal numbers. Second revised edition, Monografie Matematyczne Pa´nstowePa´nstowe Wydawnictwo Naukowe, vol.34, 1965.

M. Weyer, Decidability of S1S and S2S, Grädel et al. [13], pp.207-230
DOI : 10.1007/3-540-36387-4_12