Abstract
The termination of a confluent one-rule string-rewriting system R = { → t} is reduced to that of another one-rule system R′ = {′ → t′} such that s′ is self-overlap-free (sof). A necessary and sufficient condition is given for termination of a one-rule system R = { → t} such that s is sof and s overlaps t once on both sides.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
