Document Open Access Logo

Transforming Cycle Rewriting into String Rewriting

Authors David Sabel, Hans Zantema

PDF

File

Thumbnail PDF
PDF
LIPIcs.RTA.2015.285.pdf
  • Filesize: 0.57 MB
  • 16 pages

Document Identifiers

Subject Classification

Keywords
  • rewriting systems
  • string rewriting
  • termination

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get 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

Author Details

David Sabel
Hans Zantema
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact