Finiteness results on rewriting systems
RAIRO. Informatique théorique, Volume 15 (1981) no. 4, pp. 373-391.
@article{ITA_1981__15_4_373_0,
     author = {Raoult, Jean-Claude},
     title = {Finiteness results on rewriting systems},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {373--391},
     publisher = {EDP-Sciences},
     volume = {15},
     number = {4},
     year = {1981},
     zbl = {0491.03015},
     mrnumber = {670730},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1981__15_4_373_0/}
}
TY  - JOUR
AU  - Raoult, Jean-Claude
TI  - Finiteness results on rewriting systems
JO  - RAIRO. Informatique théorique
PY  - 1981
DA  - 1981///
SP  - 373
EP  - 391
VL  - 15
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1981__15_4_373_0/
UR  - https://zbmath.org/?q=an%3A0491.03015
UR  - https://www.ams.org/mathscinet-getitem?mr=670730
LA  - en
ID  - ITA_1981__15_4_373_0
ER  - 
%0 Journal Article
%A Raoult, Jean-Claude
%T Finiteness results on rewriting systems
%J RAIRO. Informatique théorique
%D 1981
%P 373-391
%V 15
%N 4
%I EDP-Sciences
%G en
%F ITA_1981__15_4_373_0
Raoult, Jean-Claude. Finiteness results on rewriting systems. RAIRO. Informatique théorique, Volume 15 (1981) no. 4, pp. 373-391. http://www.numdam.org/item/ITA_1981__15_4_373_0/

1. N. Bourbaki, Théorie des Ensembles, Chapt. III, § 6, No. 5, Hermann, Paris, 1963. | MR

2. G. Huet, 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

3. G. Huet and D. S. Lankford, On the Uniform Halting Problem jor Term Rewriting Systems, Rapport de Recherche, No. 283, I.R.I.A., March 1978.

4. D. E. Knuth and P. Bendix, Simple Words Problems in Universal Algebras, in Computational Problems in Abstract Algebras, Ed., J. LEECH, Pergamon Press, 1970, pp. 263-297. | MR | Zbl

5. D. S. Lankford and A. M. Ballantyne, The Rejutation Completeness of Blocked Permutative Narrowing and Resolution (to appear).

6. J. C. Raoult and J. Vuillemin, Operational and Denotational Equivalences Between Recursive Programs, Rapport de Recherche, No. 9, L.R.I., Orsay, June 1978.

7. J. W. Thatcher and J. B. Wright, 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 | Zbl