, Tiling Systems over Infinite Pictures and Their Acceptance Conditions, the Proceedings of the 6th International Conference on Developements in Language Theory, DLT 2002, pp.297-306, 2003.
DOI : 10.1007/3-540-45005-X_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.9068
, Finite Automata and Ordinals, Theoretical Computer Science, pp.119-144, 1996.
DOI : 10.1016/0304-3975(95)00006-2
URL : http://doi.org/10.1016/0304-3975(95)00006-2
, Langages Reconnaissables de Mots Indexés par des Ordinaux, 1998.
, 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 Restricted Second Order Arithmetic, Logic Methodology and Philosophy of Science, Proc. 1960 Int. Congr, pp.1-11, 1962.
, The Monadic Second Order Theory of All Countable Ordinals, Lecture Notes in Mathematics, vol.328, issue.2, 1973.
, Theories of automata on ??-tapes: A simplified approach, Journal of Computer and System Sciences, vol.8, issue.2, pp.117-141, 1974.
DOI : 10.1016/S0022-0000(74)80051-6
, ??-Computations on Turing machines, Computations on Turing Machines, pp.1-23, 1978.
DOI : 10.1016/0304-3975(78)90002-6
URL : http://doi.org/10.1016/0304-3975(78)90002-6
, Computer science and the fine structure of Borel sets, Theoretical Computer Science, vol.257, issue.1-2, pp.85-105, 2001.
DOI : 10.1016/S0304-3975(00)00111-0
URL : https://hal.archives-ouvertes.fr/hal-00103673
, Handbook of Formal Languages, Two-Dimensional Languages, vol.3, pp.215-267, 1997.
, Automates sur Mots de Longueur Supérieurè a ?, Mémoire de Licence, 1992.
, Classical Descriptive Set Theory, 1995.
DOI : 10.1007/978-1-4612-4190-4
, Decision problems for??-automata, Mathematical Systems Theory, vol.9, issue.4, pp.376-384, 1969.
DOI : 10.1007/BF01691063
, A Decade of Concurrency, Logical Specifications of Infinite Computations Lecture Notes in Computer Science, vol.803, pp.583-621, 1994.
, Descriptive Set Theory, North-Holland, 1980.
, Infinite Words, Automata, Semigroups, Logic and Games, Pure and Applied Mathematics, vol.141, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00112831
, Cardinal and Ordinal Numbers, 1965.
, Automates et Théorie Descriptive, 1992.
, Hierarchies of Recursive ?-Languages, Jour. Inform. Process. Cybernetics EIK, vol.22, issue.56, pp.219-241, 1986.
, Chapter of the Handbook of Formal languages
, Automata on Infinite Objects, Handbook of Theoretical Computer Science, vol.B, pp.133-191, 1990.
DOI : 10.1016/B978-0-444-88074-1.50009-3
, The Ordinals less than ? ? are Definable by Finite Automata Combinatorics and Logic in Computer Science, Proc. Colloquium on " Algebra, pp.871-887, 1983.
, Classes of Transfinite Sequences Accepted by Finite Automata, Fundamenta Informatic, vol.7, issue.2, pp.191-223, 1984.
, Finite Automata on Transfinite Sequences and Regular Expressions , Fundamenta Informaticae, pp.379-396, 1985.
, Borel ranks and Wadge degrees of omega context free languages, Mathematical Structures in Computer Science, vol.16, issue.5, pp.813-840, 2006.
, Wadge degrees of infinitary rational relations. Special Issue on Intensional Programming and Semantics in honour of Bill Wadge on the occasion of his 60th cycle, Mathematics in Computer Science, vol.2, issue.1, pp.85-102, 2008.
, Classical and effective descriptive complexities of omega-powers. 2007. preprint, available from http
URL : https://hal.archives-ouvertes.fr/ensl-00168644
, Set theory, third edition, 2002.
, Descriptive set theory, 1980.