1. 1) Togashi, A. and Noguchi, S.: Some decision problems and their time complexity for term rewriting systems, IEICE Trans. Inf. Syst., Vol.66, pp.1177-1184 (1983).
2. 2) Baader, F. and Nipkow, T.: Term Rewriting and All That, Cambridge University Press (1998).
3. 3) Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S. and Tommasi, M.: Tree Automata Techniques and Applications (Nov. 18th, 2008), <http://tata.gforge.inria.fr/>.
4. Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
5. Bottom-Up Rewriting Is Inverse Recognizability Preserving