Sciweavers

Share
RTA
1993
Springer

Total Termination of Term Rewriting

10 years 5 months ago
Total Termination of Term Rewriting
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally terminating. In this paper we prove that total termination is an undecidable property of nite term rewriting systems. The proof is given by means of Post's Correspondence Problem.
Maria C. F. Ferreira, Hans Zantema
Added 10 Aug 2010
Updated 10 Aug 2010
Type Conference
Year 1993
Where RTA
Authors Maria C. F. Ferreira, Hans Zantema
Comments (0)
books