1. Equivalence de transducteurs lettre à lettre d'arbres;André,1993
2. Decidability of equivalence for linear letter-to-letter top-down tree transducers;André,1993
3. Decidability of equivalence for a class of nondeterministic tree transducers;André;RAIRO Theoret. Inform. Appl.,1994
4. The equivalence problem for letter-to-letter bottom-up tree transducers is solvable;André,1995
5. Equality and disequality constraints on direct subterms in tree automata;Bogaert