Abstract
Purchase PDF (224 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (4)
Purchase PDF (349 K)
doi:10.1016/S0304-3975(98)00174-1 
Copyright © 2000 Elsevier Science B.V. All rights reserved.
Congruential complements of ground term rewrite systems*1
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Received 1 October 1997;
Abstract
Let A and B be ground term rewrite systems over some ranked alphabet Σ with ↔A*
↔B*. We say that a ground term rewrite system C over Σ is a congruential complement of A for B, if ↔A
C*=↔B* and ↔A*∩↔C* is the identity relation over TΣ. We show that, given ground term rewrite systems A, B, C over some ranked alphabet Σ with ↔A*↔B*, one can effectively decide if C is a congruential complement of A for B.
Author Keywords: Ground term rewrite system; Tree automaton; Post Correspondence Problem
*1 This research was supported by the grants OTKA F012852 and OTKA T022994 of the Research Foundation of Hungary and MKM 665/96 of the Hungarian Cultural and Educational Ministry.
Tel.: +36 (62) 311 184; fax: +36 (62) 312 292; email: vagvolgy@inf.u-szeged.hu
