Construction d'un plus petit ordre de simplification
RAIRO. Inform. théor., 18 3 (1984) 191-208
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Term Rewriting and Applications
Nachum DershowitzLecture Notes in Computer Science, Term Rewriting and Applications 3467 376 (2005)
https://doi.org/10.1007/978-3-540-32033-3_28
Rewriting Techniques and Applications
Nachum Dershowitz and Ralf TreinenLecture Notes in Computer Science, Rewriting Techniques and Applications 1379 332 (1998)
https://doi.org/10.1007/BFb0052380
Simple termination is difficult
Aart Middeldorp and Bernhard GramlichApplicable Algebra in Engineering, Communication and Computing 6 (2) 115 (1995)
https://doi.org/10.1007/BF01225647
Rewriting Techniques and Applications
Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem KlopLecture Notes in Computer Science, Rewriting Techniques and Applications 914 457 (1995)
https://doi.org/10.1007/3-540-59200-8_82
Rewriting Techniques and Applications
Aarl Middeldorp and Bernhard GramlichLecture Notes in Computer Science, Rewriting Techniques and Applications 690 228 (1993)
https://doi.org/10.1007/978-3-662-21551-7_18
690 228 (1993)
https://doi.org/10.1007/3-540-56868-9_18
Rewriting Techniques and Applications
Max DauchetLecture Notes in Computer Science, Rewriting Techniques and Applications 355 109 (1989)
https://doi.org/10.1007/3-540-51081-8_103
Termination of rewriting
Nachum DershowitzJournal of Symbolic Computation 3 (1-2) 69 (1987)
https://doi.org/10.1016/S0747-7171(87)80022-6