Finiteness results on rewriting systems
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1981)
- Volume: 15, Issue: 4, page 373-391
- ISSN: 0988-3754
Access Full Article
top
How to cite
topRaoult, Jean-Claude. "Finiteness results on rewriting systems." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 15.4 (1981): 373-391. <http://eudml.org/doc/92149>.
@article{Raoult1981,
author = {Raoult, Jean-Claude},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {term rewriting systems; equivalence classes; finite tree-automaton; confluence; rational tree languages; syntactic congruences in algebras of trees},
language = {eng},
number = {4},
pages = {373-391},
publisher = {EDP-Sciences},
title = {Finiteness results on rewriting systems},
url = {http://eudml.org/doc/92149},
volume = {15},
year = {1981},
}
TY - JOUR
AU - Raoult, Jean-Claude
TI - Finiteness results on rewriting systems
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1981
PB - EDP-Sciences
VL - 15
IS - 4
SP - 373
EP - 391
LA - eng
KW - term rewriting systems; equivalence classes; finite tree-automaton; confluence; rational tree languages; syntactic congruences in algebras of trees
UR - http://eudml.org/doc/92149
ER -
References
top- 1. N. BOURBAKI, Théorie des Ensembles, Chapt. III, § 6, No. 5, Hermann, Paris, 1963. Zbl0125.00603MR154814
- 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. MR660480
- 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. Zbl0188.04902MR255472
- 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. Zbl1282.68165
- 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. Zbl0157.02201MR224476
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.