Author： Vagvolgyi S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.309, Iss.1, 2003-12, pp. : 195-211
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
A property of left-linear rewrite systems preserving recognizability
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
Congruential complements of ground term rewrite systems
By Vagvolgyi S.
Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. :
Pattern-matching algorithms based on term rewrite systems
Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. :
Transformations and confluence for rewrite systems
By Verma R.M.
Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. :