Counterexamples to Termination for the Direct Sum of Term Rewriting Systems

Abstract

The direct sum of two term rewriting systems is the union of systems having disjoint sets of function symbols. It is shown that the direct sum of two term rewriting systems is not terminating, even if these systems are both terminating. Keyword: Term rewriting system, termination Introduction A term rewriting system R is a set of rewriting rules M → N… (More)
DOI: 10.1016/0020-0190(87)90122-0

Topics

Cite this paper

@article{Toyama1987CounterexamplesTT, title={Counterexamples to Termination for the Direct Sum of Term Rewriting Systems}, author={Yoshihito Toyama}, journal={Inf. Process. Lett.}, year={1987}, volume={25}, pages={141-143} }