1. Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, New York (1998)
2. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007),
http://tata.gforge.inria.fr
3. Comon, H., Jacquemard, F.: Ground reducibility is EXPTIME-complete. Information and Computation 187(1), 123–153 (2003)
4. Godoy, G., Hernández, H.: Undecidable properties for flat term rewrite systems (submitted) (2008)
5. Lecture Notes in Computer Science;G. Godoy,2007