1. Lecture Notes in Computer Science;N. Dershowitz,1981
2. Dershowitz, N.: Termination of rewriting. J. Symbolic Comput. 3(1–2), 69–115 (1987)
3. Geser, A.: Decidability of Termination of Grid String Rewriting Rules. SIAM J. Comput. 31(4), 1156–1168 (2002)
4. Lecture Notes in Computer Science;A. Geser,2003
5. Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems and automated termination proofs. In: Rubio, A. (ed.) Proc. 6th Int. Workshop on Termination WST-03, Technical Report DSIC-II/15/03, Universidad Politécnica de Valencia, Spain, pp. 19–22 (2003)