Left-Linear Right-Ground Term Rewrite Systems and Ground Term Rewrite Systems
Sándor Vágvölgyi · SSRN Electronic Journal · 2003
For an arbitrary term rewrite system over a ranked alphabet Σ, we restrict the rewriting relation → to ground terms. We study the relation → = → ∩( × ). We show that for a given left-linear right-ground term rewrite system over a ranked alphabet Σ it is decidable whether there is a ground term rewrite system over Σ such that .