[Submit a comment] [RTALooP home] [Index] [Previous] [Next] | [Postscript] [PDF] [BibTeX Source] [LaTeX Source] |
Originator: Hans Zantema
Date: 1999
Summary: Is there a one-rule string rewriting system that is non-terminating but also non-looping?
Is there a one-rule string rewriting system that is non-terminating but also non-looping, that is not allowing a rewrite sequence x →^{*} uxv ? Motivation and examples of two rule string rewriting systems and a one rule term rewriting system that is non-terminating and non-looping, can be found in [ZG96].
This problem is related to Problem #21 and Problem #87. More about the history of this problem in the context of the question of one-rule termination can be found in [Der05].
[Submit a comment] [RTALooP home] [Index] [Previous] [Next] | [Postscript] [PDF] [BibTeX Source] [LaTeX Source] |