TY  - RPRT
A1  - Sabel, David
A1  - Zantema, Hans
T1  - Termination of cycle rewriting by transformation and matrix interpretation
N2  - We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected. Our main technique is to transform cycle rewriting into string rewriting and then apply state of the art techniques to prove termination of the string rewrite system. We present three such transformations, and prove for all of them that they are sound and complete. In this way not only termination of string rewriting of the transformed system implies termination of the original cycle rewrite system, a similar conclusion can be drawn for non-termination. Apart from this transformational approach, we present a uniform framework of matrix interpretations, covering most of the earlier approaches to automatically proving termination of cycle rewriting. All our techniques serve both for proving termination and relative termination. We present several experiments showing the power of our techniques.
KW  - rewriting systems
KW  - string rewriting
KW  - termination
KW  - relative termination
Y1  - 2016
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/42272
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30:3-422722
N1  - (c) D. Sabel and H. Zantema Creative Commons
ER  -