Author:
Kojima Yoshiharu,Sakai Masahiko,Nishida Naoki,Kusakari Keiichirou,Sakabe Toshiki
Publisher
Information Processing Society of Japan
Reference16 articles.
1. 1) Baader, F. and Nipkow, T.: Term Rewriting and All That, Cambridge University Press (1998).
2. 2) Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S. and Tommasi, M.: Tree Automata Techniques and Applications, Available on: http://tata.gforge.inria.fr/ (2008). release November, 18th, 2008.
3. Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
4. Bottom-Up Rewriting Is Inverse Recognizability Preserving
5. Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems