On tree automata that certify termination of left-linear term rewriting systems

@article{Geser2007OnTA,
  title={On tree automata that certify termination of left-linear term rewriting systems},
  author={Alfons Geser and Dieter Hofbauer and Johannes Waldmann and Hans Zantema},
  journal={Inf. Comput.},
  year={2007},
  volume={205},
  pages={512-534}
}
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term rewriting system terminates on a given regular language of terms, we first construct an enriched system over a new signature that simulates the original derivations. The enriched system is an infinite system over an infinite signature, but it is locally terminating: every restriction of the enriched system to a… CONTINUE READING
Highly Cited
This paper has 76 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

76 Citations

051015'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 76 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Tree automata that certify termination of term rewriting systems

  • A. Geser, D. Hofbauer, J. Waldmann, H. Zantema
  • Proc. 7th Int. Workshop on Termination WST-04,
  • 2004
1 Excerpt

Termination. In Terese, Term Rewriting Systems, pp. 181–259

  • H. Zantema
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…