𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On termination of one rule rewrite systems

✍ Scribed by Pierre Lescanne

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
384 KB
Volume
132
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Completion of Rewrite Systems with Membe
Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules
✍ H. Comon πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 562 KB

We consider a constrained equational logic where the constraints are membership conditions t ∈ s where s is interpreted as a regular tree language. Our logic includes a fragment of second-order equational logic (without projections) where second-order variables range over regular sets of contexts. T