Abstract
It is not known whether the termination problem is decidable for one-rule string-rewriting systems, though the confluence of such systems is decidable by Wrathall (in: Word Equations and Related Topics, Lecture Notes in Computer Science, vol. 572, 1992, pp. 237–246). In this paper we develop techniques to attack the termination and complexity problems of confluent one-rule string-rewriting systems. With given such a system we associate another rewriting system over another alphabet. The behaviour of the two systems is closely related and the termination problem for the new system is sometimes easier than for the original system. We apply our method to systems of the special type {apbq→t}, where t is an arbitrary word over {a,b}, and give a complete characterization for termination. We also give a complete analysis of the derivational complexity for the system {apbq→bnam}.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
