On termination of confluent one-rule str
β
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