Sciweavers

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

12

RTA
2007
Springer

favoriteEmaildiscussreport

84views Theoretical Computer Science» more RTA 2007»

Proving Termination of Rewrite Systems Using Bounds

13 years 10 months ago

Proving Termination of Rewrite Systems Using Bounds

Download cl-informatik.uibk.ac.at

The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. We extend their work to non-left-linear rewrite systems. The key to this extension is the introduction of so-called raise rules and the use of tree automata that are not quite deterministic. Furthermore, we present negative solutions to two open problems related to string rewrite systems.

Martin Korp, Aart Middeldorp

Real-time Traffic

Left-linear Term Rewrite | Rewrite Systems | RTA 2007 | String Rewrite Systems | Theoretical Computer Science |

claim paper

Related Content

» Proving Termination Properties with muterm

» Cdiprover3 A Tool for Proving Derivational Complexities of Term Rewriting Systems

» Proving Termination by Bounded Increase

» Polynomial Interpretations and the Complexity of Algorithms

» Proving Innermost Normalisation Automatically

» On Tree Automata that Certify Termination of LeftLinear Term Rewriting Systems

» TORPA Termination of Rewriting Proved Automatically

» Proving Liveness with Fairness Using Rewriting

» Proving Positive AlmostSure Termination

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	RTA
Authors	Martin Korp, Aart Middeldorp

Comments (0)