Termination of single-threaded one-rule semi-thue systems

Authors:
Wojciech Moczydłowski;Alfons Geser
Affiliations:
Dept. of Computer Science, Cornell University, Ithaca, NY;National Institute for Aerospace (NIA), Hampton, VA
Venue:
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Year:
2005

Citing 5
Cited 4

String-rewriting systems

String-rewriting systems
Termination and derivational complexity of confluent one-rule string-rewriting systems

Theoretical Computer Science
Theory of Automata

Theory of Automata
Semi-Thue Systems with an Inhibitor

Journal of Automated Reasoning
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds

Journal of Automated Reasoning

LARS: A learning algorithm for rewriting systems

Machine Learning
Termination by quasi-periodic interpretations

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Open. closed. open.

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
On One-Rule Grid Semi-Thue Systems

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju

Quantified Score

Hi-index	0.00

Visualization

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.