참고문헌
- Trans. Amer. Math. Soc. v.39 Some properties of conversion Church, A.;Rosser, J.B.
- J. of Symbolic Comput. v.3 Thrmintion of rewriting Dershowitz, N.
- Technical Report Memo MTP-3. Mathematics Department, Louisiana Tech. University On proving term rewriting systems are Noetherian Lankford, D.S.
- Theoretical Computer Science v.17 Ordering for term rewriting systems Dershowitz, N.
- Thechnical Report R-78-943, Dept. of Computer Science Recursively defined ordering for proving termination of term rewriting systems Plaisted, D.A.
- Journal of Automated Reasoning v.6 On the recursive decomposition ordering with lexicographic status and other related ordering Lescanne, P.
- Proc. 10th Colloq. Trees in Algebra and Programming A path ordering for priving termination of term rewriting systems Kapur, D.;Narendren, P.;Sivakumar, G.
- Computational Problems in Abstract Algebra Simple word problems in universal algebra Knuth, D.E.;Bendix, P.B.;J. Leech(ed.)
- Ann. Math. v.43 On theories with a combinatorial definition of equivalence Newman, M.H.A.
- Journal of ACM v.27 Confluent reductions: Abstract properties and applications to term rewriting systems Huet, G.
- Proc. of the 13th Colloq. on Automata On non-termination of Knuth-Bendix algorithm Hermann, M.;Privara
- Proc. Combridge Philos. Soc. v.47 On multiplicative systems defined by generators and relations Evans, T.
- Universal algebra Equational Logic Taylor, W.;G. Gratzer(ed.)
- Dokl. Akad. Nauk SSSR 55 The impossibility of some algorithms in the theory of associative systems Markov, A.A.
- J. Symbolic Logic v.13 Recursive unsolvability of a problem of Thue Post, E.L.
- Combinatory Logic Curry, H.B.;Feys, R.
- Solvable Cases of the Decision Problem Ackermann, W.