1. Lect Notes Comput Sci;A. Bouajjani,1997
2. A. Bouajjani, J. Esparza, A. Finkel, O. Maler, P. Rossmanith, B. Willems, and P. Wolper, An efficient automata approach to some problems on context-free grammars, Information Processing Letters, Vol 74, 2000.
3. Lect Notes Comput Sci;D. Caucal,1990
4. O. Corolleur, Etude de jeux sur les graphes de transitions des automates à pile, Rapport de stage d’option informatique, Ecole Polytechnique, 2001.
5. E. A. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy, FoCS’ 91, IEEE Computer Society Press, pp. 368–377, 1991.