Z. Mann and S. Ness. On the Termination of Markov Algorithms. In Proceedings of the 3rd Hawaii International Conference on System Science, pages 789--792, 1970.  Home/Search   Document Not in Database   Summary   Related Articles

....R 2 is certainly simplifying. In order to show the same for R 1 we have to prove (cf. Proposition 3.16) that the unconditional TRS S 1 [ F e 1 = f F (x; x) F (a; b) F (x; x) x; F (x; y) x; F (x; y) y g: is terminating. We show this using a technique suggested by Manna and Ness [MN70] (cf. also page 270 of [DJ90] and the survey of [Zan91] Let W = IN Theta INn f0; 0g ; aW = 1; 0) b W = 0; 1) and FW : W Theta W W with FW ( 1; 0) 0; 1) FW ( 0; 1) 1; 0) 2; 2) FW ( 1; 0) 1; 0) FW ( 0; 1) 0; 1) 3; 3) FW ( k; l) m; n) k m 4; l n 4) if ....

Z. Mann and S. Ness. On the Termination of Markov Algorithms. In Proceedings of the 3rd Hawaii International Conference on System Science, pages 789--792, 1970.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC