Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

RTA
1993
Springer

favoriteEmaildiscussreport

137views Theoretical Computer Science» more RTA 1993»

Total Termination of Term Rewriting

13 years 8 months ago

Total Termination of Term Rewriting

Download igitur-archive.library.uu.nl

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

Real-time Traffic

Monotonic Well-founded Order | RTA 1993 | Term Rewriting Systems | Theoretical Computer Science | Total Termination |

claim paper

Related Content

» Decidability of Innermost Termination and ContextSensitive Termination for SemiConstructor...

» Termination of Fair Computations in Term Rewriting

» Termination of justfair computations in term rewriting

» A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

» Proving Termination Properties with muterm

» Narrowing Directed by a Graph of Terms

» Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting

» Proving Termination of Rewrite Systems Using Bounds

» Automated Termination Analysis of Java Bytecode by Term Rewriting

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	RTA
Authors	Maria C. F. Ferreira, Hans Zantema

Comments (0)