Termination of Single-Threaded One-Rule Semi-Thue Systems

Abstract. This paper is a contribution to the long standing open problem of uniform termination of Semi-Thue Systems that consist of one rule s → t. McNaughton previously showed that rules incapable of (1) deleting t completely from both sides, (2) deleting t completely from the left, and (3) deleting t completely from the right, have a decidable uniform termination problem. We use a novel approach to show that Premise (2) or, symmetrically, Premise (3), is inessential. Our approach is based on derivations in which every pair of successive steps has an overlap. We call such derivations single-threaded. Key Words and Phrases: string rewriting, semi-Thue system, uniform termination, termination, one-rule, single-rule, single-threaded, well-behaved

• Type: Conference
• Year: 2005
• Where: RTA
• Authors: Wojciech Moczydlowski, Alfons Geser
• Keywords: Decidable Uniform Termination, RTA 2005, Semi-thue System, Theoretical Computer Science, Uniform Termination