Transforming cycle rewriting into string rewriting

D. Sabel, H. Zantema

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)
2 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationRewriting Techniques and Applications (26th International Conference, RTA'15, Warsaw, Poland, June 29-July 3, 2015)
EditorsM. Fernández
Place of PublicationDagstuhl
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Pages285-300
ISBN (Print)978-3-939897-85-9
DOIs
Publication statusPublished - 2015

Publication series

NameLIPIcs: Leibniz International Proceedings in Informatics
Volume36
ISSN (Print)1868-8968

Fingerprint Dive into the research topics of 'Transforming cycle rewriting into string rewriting'. Together they form a unique fingerprint.

Cite this