J. Autebert, J. Berstel, and L. Boasson, 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

J. Berstel, C. Transductions, and . Free-languages, Teubner Studienb&quot ;ucher Informatik Wadge hierarchy and Veblen hierarchy Part 1 : Borel sets of finite rank Jacques Duparc, Wadge hierarchy and Veblen hierarchy. Part 2 : Borel sets of infinite rank, submitted to the Journal of Symbolic Logic, Dup01] Jacques Duparc, pp.56-86, 1979.

O. Finkel and A. -. , [FS03] Olivier Finkel and Pierre Simonnet, Topology and Ambiguity in Omega Context Free Languages, Borel Set of Infinite Rank, Fundamenta Informaticae Bulletin of the Belgian Mathematical Society, vol.62, issue.105, pp.333-342, 2003.

E. John, J. D. Hopcroft, and . Ullman, Formal Languages and their Relation to Automata, 1969.

C. Kuratowski-topologie, I. , and I. , 5 x 18 oblong, 528 p., BrochZ, 2 tomes en 1 volume, ISBN 2-87647-141-8. [Lec01] Dominique Lecomte, Sur les Ensembles de Phrases Infinies Constructibles a Partir d'un Dictionnaire sur un Alphabet Fini, Séminaire d'Initiation a l'Analyse, Editions Jacques Gabay Journal of Symbolic Logic, vol.24, issue.704, pp.1210-1232, 1958.

H. Lescow and W. Thomas, A Decade of Concurrency, Logical Specifications of Infinite Computations LNCS, vol.803, pp.583-621, 1994.

D. Niwinski, Problem on -Powers posed in the Proceedings of the 1990 Workshop " Logics and Recognizable Sets

L. Staiger, Hierarchies of Recursive -Languages, Jour. Inform. Process. Cybernetics EIK, vol.226, issue.5, pp.219-241, 1986.

L. Staiger, Chapter of the Handbook of Formal Languages, 1997.

W. William, Wadge Degrees of complexity of subsets of the Baire space, Notice A.M.S, p.714, 1972.

W. William, Wadge Reducibility and determinateness on the Baire space [vW78] Robert A. van Wesep Wadge degrees and descriptive set theory Cabal Seminar, Proc. Caltech-UCLA Logic Sem, pp.76-77, 1978.