Non-looping rewriting
Hans Zantema, Alfons Geser · Utrecht University Repository (Utrecht University) · 1996
In this paper we present a n umberofnecessary conditions for the existence of loops, i.e. reductions of the form t !+ R c [t].We investigate which of the known termination preserving transformation methods also preserve the non-existence of loops.We c haracterize the existence of loops by overlap closures.We illustrate these methods at new examples of a one-rule term rewriting system and a two-rule string rewriting system which admit a non-terminating reduction but no loop.