@article{ITA_1981__15_4_373_0, author = {Raoult, Jean-Claude}, title = {Finiteness results on rewriting systems}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, volume = {15}, year = {1981}, pages = {373-391}, mrnumber = {670730}, zbl = {0491.03015}, language = {en}, url = {http://dml.mathdoc.fr/item/ITA_1981__15_4_373_0} }
Raoult, Jean-Claude. Finiteness results on rewriting systems. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 15 (1981) pp. 373-391. http://gdmltest.u-ga.fr/item/ITA_1981__15_4_373_0/
1. Théorie des Ensembles, Chapt. III, § 6, No. 5, Hermann, Paris, 1963. | MR 154814
,2. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, in Proceedings of the 18th annual I.E.E.E. Symposium on Fondations of Computer Science, October 1977. | MR 660480
,3. On the Uniform Halting Problem jor Term Rewriting Systems, Rapport de Recherche, No. 283, I.R.I.A., March 1978.
and ,4. Simple Words Problems in Universal Algebras, in Computational Problems in Abstract Algebras, Ed., J. LEECH, Pergamon Press, 1970, pp. 263-297. | MR 255472 | Zbl 0188.04902
and ,5. The Rejutation Completeness of Blocked Permutative Narrowing and Resolution (to appear).
and ,6. Operational and Denotational Equivalences Between Recursive Programs, Rapport de Recherche, No. 9, L.R.I., Orsay, June 1978.
and ,7. Generalized Finite Automata Theory with an Application to a Decision Problem of Second Order Logic, Math. System Theory, Vol. 2, 1968, pp. 57-81. | MR 224476 | Zbl 0157.02201
and ,