1. A.C. Caron, F. Seynhaeve, S. Tison, and M. Tommasi. Solving One-step Rewriting Formulae. In 12th Workshop on Unification, Roma (Italy). U. of Roma, 1998.
2. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications (TATA). http://l3ux02.univ-lille3.fr/tata .
3. F. Jacquemard. Automates d’Arbres et R_e_ecriture de Termes. Thèse de Doctorat d’Université, Université de Paris-sud, 1996. In french.
4. S. Limet and P. Réty. E-Unification by Means of Tree Tuple Synchronized Grammars. DMTCS ( http://dmtcs.loria.fr/ ), 1:69–98, 1997.
5. S. Limet and P. Rety. A new result about the decidability of the existential one-step rewriting theory. Research Report RR-LIFO-98-12, LIFO, 1998.