, André Arnold. A syntactic congruence for rational ?-languages, Theoret. Comput. Sci, vol.39, issue.1, pp.333-335, 1985.
, 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
, 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
, Langages reconnaissables de mots indéxés par des ordinaux, Thèse, 1998.
, 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
, 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
, 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
, Automata on Linear Orderings, Lect. Notes in Comput. Sci, vol.2136, pp.236-247, 2001.
DOI : 10.1007/3-540-44683-4_21
, Hierarchy among automata on linear orderings, Foudation of Information technology in the era of network and mobile computing, pp.107-118, 2002.
, 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
, 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
, On a decision method in the restricted second-order arithmetic Transfinite automata recursions and weak second order theory of ordinals, Proc. Int. Congress Logic, Methodology and Philosophy of Science Proc. Int. Congress Logic, Methodology, and Philosophy of Science, pp.1-11, 1960.
, The monadic second order theory of all countable ordinals, volume 328 of Lecture notes in mathematics, 1973.
, Unambiguous B??chi automata, Theoretical Computer Science, vol.297, issue.1-3, pp.37-81
DOI : 10.1016/S0304-3975(02)00618-7
, 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
, Complementation of rational sets on scattered linear orderings of finite rank, Theoret. Comput. Sci, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00619905
, 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
, Bilimites de langages reconnaissables, Theoretical Computer Science, vol.33, issue.2-3, pp.335-342, 1984.
DOI : 10.1016/0304-3975(84)90095-1
, Representation of events in nerve nets and finite automata, Automata studies, pp.3-41, 1956.
, Application of model theoretic games to discrete linear orders and finite automata, Information and Control, vol.33, issue.4, pp.281-303, 1977.
DOI : 10.1016/S0019-9958(77)90443-0
, 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
, Counter free automata, 1971.
, 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
, Ensembles reconnaissables de mots bi-infinis, Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp.47-59, 1982.
, Etude syntaxique des parties reconnaissables de mots infinis, Lect. Notes in Comput. Sci, vol.226, pp.294-303, 1986.
DOI : 10.1007/3-540-16761-7_79
, Varietes de Semis Groupes et Mots Infinis, Lect. Notes in Comput. Sci, vol.210, pp.180-191, 1986.
DOI : 10.1007/3-540-16078-7_75
, Recent results on automata and infinite words, Mathematical foundations of computer science, pp.134-148, 1984.
DOI : 10.1007/BFb0030294
, Finite Automata, pp.1-57, 1990.
DOI : 10.1016/B978-0-444-88074-1.50006-8
URL : https://hal.archives-ouvertes.fr/hal-00620817
, Semigroups and Automata on Infinite Words, NATO Advanced Study Institute Semigroups, Formal Languages and Groups, pp.49-72, 1995.
DOI : 10.1007/978-94-011-0149-3_3
, Infinite Words : Automata, Semigroups , Logic and Games, volume 141 of Pure and Applied Mathematics Jean-´ Eric Pin. Varieties of Formal Languages, 1986.
, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc, vol.141, pp.1-35, 1969.
, On a problem on formal logic, Proc. London Math. Soc, vol.30, issue.2, pp.264-286, 1929.
, Complementation of Rational Sets on Countable Scattered Linear Orderings, Lect. Notes in Comput. Sci, vol.3340, pp.381-392, 2004.
DOI : 10.1007/978-3-540-30550-7_32
URL : https://hal.archives-ouvertes.fr/hal-00160985
, Linear Orderings, 1982.
, 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
, Leçons sur les nombres transfinis. Gauthier-Villars, 1950.
, Cardinal and ordinal numbers, 1965.
, Star-free regular sets of ??-sequences, Information and Control, vol.42, issue.2, pp.148-156, 1979.
DOI : 10.1016/S0019-9958(79)90629-6
, An EILENBERG theorem for ???-languages, ICALP '91, pp.588-599, 1991.
DOI : 10.1007/3-540-54233-7_166
, AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS, International Journal of Algebra and Computation, vol.03, issue.04, pp.447-489, 1993.
DOI : 10.1142/S0218196793000287
, The ordinals less than ? ? are definable by finite automata, Proc. Colloquium on " Algebra, Combinatorics and Logic in Computer Science, pp.871-887, 1983.
, Finite automata on transfinite sequences and regular expressions. Fundamenta informaticae, pp.379-396, 1985.