1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, United Kingdom (1998)
2. Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (TATA) (1997),
http://www.grappa.univ-lille3.fr/tata
3. Comon, H., Haberstrau, M., Jouannaud, J.-P.: Syntacticness, cycle-syntacticness, and shallow theories. Information and Computation 111(1), 154–191 (1994)
4. Faßbender, H., Maneth, S.: A strict border for the decidability of e-unification for recursive functions. Journal of Functional and Logic Programming 1998(4) (1998)
5. Limet, S., Réty, P.: E-unification by means of tree tuple synchronized grammars. Discrete Mathematics and Theoretical Computer Science 1, 69–98 (1997)