Abstract
Purchase PDF (404 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (224 K)
doi:10.1016/S0304-3975(02)00745-4 
Copyright © 2002 Elsevier Science B.V. All rights reserved.
Term rewriting restricted to ground terms
Sándor Vágvölgyi
, 1
Received 15 November 2000;
revised 6 August 2002;
accepted 27 September 2002;
Communicated by A. Salomaa
Available online 16 April 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We study rewriting of ground terms. For an arbitrary term rewrite system R over a ranked alphabet Σ, we restrict the rewriting relation →R to ground terms. We introduce the relation →R,g=→R∩(TΣ×TΣ). We show that ↔R,g*=↔R*∩(TΣ×TΣ). We show that for a given term rewrite system R and a given ground term rewrite system S over a ranked alphabet Σ it is decidable if ↔R,g* 
↔S*. We show that for a given left-linear right-ground term rewrite system R over a ranked alphabet Σ it is decidable if there is a ground term rewrite system S over Σ such that →R,g*=→S*.
Author Keywords: Term rewrite system; Ground term rewrite system; Word problem; Tree automaton; Preserving recognizability
