, Topological Characterizations of Infinite Behaviours of Transition Systems, Automata, Languages and Programming, Lecture Notes in Computer Science, pp.28-38, 1983.
, Context-Free Languages and Pushdown Automata, Handbook of Formal Languages, 1996.
DOI : 10.1007/978-3-642-59136-5_3
URL : https://hal.archives-ouvertes.fr/hal-00620669
, Abstract, The Journal of Symbolic Logic, vol.1333, issue.01, pp.56-86, 2001.
DOI : 10.2307/1971035
, An ?-Power of a Context-Free Language Which Is Borel Above ? 0
URL : https://hal.archives-ouvertes.fr/ensl-00147245
, Formal Languages and their Relation to Automata, 1969.
, Classical Descriptive Set Theory, 1995.
, The Journal of Symbolic Logic, pp.915-920, 1989.
, Sur les Ensembles de Phrases Infinies Constructibles a Partir d'un Dictionnaire sur un Alphabet Fini, Séminaire d'Initiation a l'Analyse, 2001.
, Abstract, The Journal of Symbolic Logic, vol.3, issue.04, pp.1210-1232, 2005.
DOI : 10.1090/S0002-9939-97-03770-2
URL : https://hal.archives-ouvertes.fr/ensl-00319447
, A Decade of Concurrency, Logical Specifications of Infinite Computations, pp.583-621, 1994.
, Problem on ?-Powers posed in the Proceedings of the 1990 Workshop " Logics and Recognizable Sets
, Infinite Words, Automata, Semigroups, Logic and Games, Pure and Applied Mathematics, vol.141, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00112831
, Automates et Théorie Descriptive, 1992.
, Hierarchies of Recursive ?-Languages, Jour. Inform. Process. Cybernetics EIK, vol.226, issue.5, pp.219-241, 1986.
, Staiger, ?-Languages, Chapter of the Handbook of Formal Languages, 1997.
, On ?-Power Languages, in New Trends in Formal Languages, Control, Coperation, and Combinatorics, Lecture Notes in Computer Science, vol.1218, pp.377-393, 1997.
, 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