RTA 2005: Term Rewriting and Applications pp 338-352

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

  • Wojciech Moczydłowski
  • Alfons Geser
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3467)

Abstract

This paper is a contribution to the long standing open problem of uniform termination of Semi-Thue Systems that consist of one rule st. 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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Wojciech Moczydłowski
    • 1
  • Alfons Geser
    • 2
  1. 1.Dept. of Computer ScienceCornell UniversityIthacaUSA
  2. 2.National Institute for Aerospace (NIA)HamptonUSA

Personalised recommendations