LIPIcs.RTA.2015.285.pdf
- Filesize: 0.57 MB
- 16 pages
Document
Transforming Cycle Rewriting into String Rewriting
Authors
-
Part of:
Volume:
26th International Conference on Rewriting Techniques and Applications (RTA 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2015-06-18
Cite AsGet BibTex
David Sabel and Hans Zantema. Transforming Cycle Rewriting into String Rewriting. In 26th International Conference on Rewriting Techniques and Applications (RTA 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 36, pp. 285-300, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.RTA.2015.285
https://doi.org/10.4230/LIPIcs.RTA.2015.285
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.
Keywords
- rewriting systems
- string rewriting
- termination
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads