License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2015.285
URN: urn:nbn:de:0030-drops-52032
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5203/
Sabel, David ;
Zantema, Hans
Transforming Cycle Rewriting into String Rewriting
Abstract
We present new 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. Apart from this transformational approach, we extend the use of matrix interpretations as was studied before. We present several experiments showing that often our new techniques succeed where earlier techniques fail.
BibTeX - Entry
@InProceedings{sabel_et_al:LIPIcs:2015:5203,
author = {David Sabel and Hans Zantema},
title = {{Transforming Cycle Rewriting into String Rewriting}},
booktitle = {26th International Conference on Rewriting Techniques and Applications (RTA 2015)},
pages = {285--300},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-85-9},
ISSN = {1868-8969},
year = {2015},
volume = {36},
editor = {Maribel Fern{\'a}ndez},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5203},
URN = {urn:nbn:de:0030-drops-52032},
doi = {10.4230/LIPIcs.RTA.2015.285},
annote = {Keywords: rewriting systems, string rewriting, termination}
}
|
Keywords: |
|
rewriting systems, string rewriting, termination |
|
Collection: |
|
26th International Conference on Rewriting Techniques and Applications (RTA 2015) |
|
Issue Date: |
|
2015 |
|
Date of publication: |
|
18.06.2015 |
