1. B. Bogaert and S. Tison. Equality and disequality constraints on brother terms in tree automata. In A. Finkel, editor, Proc. 9th Symp. on Theoretical Aspects of Computer Science, Paris, 1992. Springer-Verlag.
2. R. Bündgen and W. Küchlin. Computing ground reductibility and inductively complete positions. Universitaet Tübingen, Oct. 1988.
3. A.-C. Caron, J.-L. Coquidé, and M. Dauchet. Encompassment properties and automata with constraints. In Proc. RTA 93, 1993.
4. H. Comon. Unification et disunification: Théorie et applications. Thèse de Doctorat, Institut National Polytechnique de Grenoble, France, 1988.
5. N. Dershowitz and J.-P. Jouannaud. Notations for rewriting. EATCS Bulletin, 43:162–172, 1990.