It is well known that it is undecidable whether a term rewriting system is terminating. We prove in this paper that the property remains undecidable if the system has only one rule.
CITATION STYLE
Dauchet, M. (1988). Termination of rewriting is undecidable in the one-rule case. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 324 LNCS, pp. 262–270). Springer Verlag. https://doi.org/10.1007/BFb0017149
Mendeley helps you to discover research relevant for your work.