On termination of one rule rewrite systems
LescannePierre · Theoretical Computer Science · 1994
The undecidability of the termination of rewrite systems is usually proved by reduction to the halting of Turing machines. In particular, Dauchet proves the undecidability of the termination of one...