Author： Yamada T. Avenhaus J. Lora-Saenz C. Middeldorp A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.236, Iss.1, 2000-04, pp. : 209-232
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
Transformations and confluence for rewrite systems
By Verma R.M.
Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. :
Journal of Symbolic Computation, Vol. 22, Iss. 3, 1996-03 ,pp. :
Simple termination of rewrite systems
Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. :
Infinite String Rewrite Systems and Complexity
By Birget J.C.
Journal of Symbolic Computation, Vol. 25, Iss. 6, 1998-06 ,pp. :