1. A. Arnold, Le théorème de transversale rationnelle dans les arbres, Tech. Report I.T.3-78, Laboratoire d'Informatique Fondamentale de Lille, 1978.
2. Morphismes et bimorphismes d'arbres;Arnold;Theoret. Comput. Sci.,1982
3. The recognizability problem for tree automata with comparisons between brothers;Bogaert,1999
4. Equality and disequality constraints on direct subterms in tree automata;Bogaert,1992
5. A.-C. Caron, H. Comon, J.-L. Coquidé, M. Dauchet, F. Jacquemard, Pumping, cleaning and symbolic constraints solving, in: S. Abiteboul, E. Shamir (Eds.), Automata, Languages and Programming, 21st Internat. Colloq., Lecture Notes in Computer Science, Vol. 820, Springer, Berlin, Jerusalem, Israel, 11–14 July, 1994, pp. 436–449.