1. N. Bedon. Langages reconnaissables de mots indéxés par des ordinaux. Thèse de doctorat, Université de Marne-la-Vallée, 1998. 118
2. N. Bedon and O. Carton. An Eilenberg theorem for words on countable ordinals. In Claudio L. Lucchesi and Arnaldo V. Moura, editors, Latin’98: Theoretical Informatics, volume 1380 of Lect. Notes in Comput. Sci., pages 53–64. Springer-Verlag, 1998.
3. V. Bruyère and O. Carton. Automata on linear orderings. In J. Sgall, A. Pultr, and P. Kolman, editors, MFCS’2001, volume 2136 of Lect. Notes in Comput. Sci., pages 236–247, 2001. IGM report 2001–12.
4. J. R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik und grundl. Math., 6: 66–92, 1960.
5. J. R. Büchi. Transfinite automata recursions and weak second order theory of ordinals. In Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964, pages 2–23. North Holland, 1965.