9 citations · 40 across the 22 of their papers we have counts for
9 papers · 1 filter
Proceedings 9th International Workshop on Computing with Terms and Graphs
Andrea Corradini, Hans Zantema
This volume contains the proceedings of TERMGRAPH 2016, the Ninth International Workshop on Computing with Terms and Graphs which was held on April 8, 2016 in Eindhoven, The Nether…
Termination of Cycle Rewriting by Transformation and Matrix Interpretation
David Sabel, Hans Zantema
We present 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 i…
Proving Looping and Non-Looping Non-Termination by Finite Automata
Jörg Endrullis, Hans Zantema
A new technique is presented to prove non-termination of term rewriting. The basic idea is to find a non-empty regular language of terms that is closed under rewriting and does not…
Proving Termination of Graph Transformation Systems using Weighted Type Graphs over Semirings
H. J. Sander Bruggink, Barbara König, Dennis Nolte +1
We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapt…
Non-termination using Regular Languages
Jörg Endrullis, Hans Zantema
We describe a method for proving non-looping non-termination, that is, of term rewriting systems that do not admit looping reductions. As certificates of non-termination, we employ…
Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic
Hans Zantema
In this paper we give a criterion by which one can conclude that every reduction of a basic term to normal form has the same length. As a consequence, the number of steps to reach…