✦ LIBER ✦

On termination of the direct sum of term-rewriting systems

✍ Scribed by Michael Rusinowitch

Book ID: 113162993
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 619 KB
Volume: 26
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90039-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counterexamples to termination for the d

Counterexamples to termination for the direct sum of term rewriting systems

✍ Yoshihito Toyama 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 175 KB

On tree automata that certify terminatio

On tree automata that certify termination of left-linear term rewriting systems

✍ Alfons Geser; Dieter Hofbauer; Johannes Waldmann; Hans Zantema 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Modularity of simple termination of term

Modularity of simple termination of term rewriting systems with shared constructors

✍ Masahito Kurihara; Azuma Ohuchi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 640 KB

Characterizing and proving operational t

Characterizing and proving operational termination of deterministic conditional term rewriting systems

✍ Felix Schernhammer; Bernhard Gramlich 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 581 KB

Modular termination of r-consistent and

Modular termination of r-consistent and left-linear term rewriting systems

✍ Manfred Schmidt-Schauß; Massimo Marchiori; Sven Eric Panitz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 940 KB

On termination of confluent one-rule str

On termination of confluent one-rule string-rewriting systems

✍ Kayoko Shikishima-Tsuji; Masashi Katsura; Yuji Kobayashi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 507 KB

The termination of a confluent one-rule string-rewriting system R = (s + I} is reduced to that of another one-rule system K = {s' -B t') such that s' is self-overlap-free &of). A necessary and sufficient condition is given for termination of a one-rule system R = {s --+ t} such that s is sof and s o