Termination of Cycle Rewriting by Transformation and Matrix Interpretation

DOI10.23638/LMCS-13(1:11)2017zbMath1398.68281arXiv1609.07065OpenAlexW2524395091MaRDI QIDQ2980975

David Sabel, Hans Zantema

Publication date: 8 May 2017

Full work available at URL: https://arxiv.org/abs/1609.07065

zbMATH Keywords

rewriting systemsterminationstring rewritingrelative termination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

An automated approach to the Collatz conjecture

Uses Software

• Yices
• Tyrolean
• AProVE

Cites Work

• Unnamed Item
• Unnamed Item
• Levels of undecidability in rewriting
• Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\)
• Matrix interpretations for proving termination of term rewriting
• Termination of term rewriting: Interpretation and type elimination
• Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings
• Termination Analysis for Graph Transformation Systems
• Proving Termination of Programs Automatically with AProVE
• Termination Competition (termCOMP 2015)
• Arctic Termination ...Below Zero
• Termination of String Rewriting with Matrix Interpretations
• Transforming SAT into Termination of Rewriting
• Termination of Cycle Rewriting
• Proving non-termination by finite automata
• Transforming Cycle Rewriting into String Rewriting
• Transformation techniques for context-sensitive rewrite systems

This page was built for publication: Termination of Cycle Rewriting by Transformation and Matrix Interpretation