Author： Schmidt-Schausz M. Marchiori M. Panitz S.E.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.149, Iss.2, 1995-10, pp. : 361-374
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
A property of left-linear rewrite systems preserving recognizability
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
Access to resources
Recommend
Modular proofs for completeness of hierarchical term rewriting systems
By Rao M.R.K.K.
Theoretical Computer Science, Vol. 151, Iss. 2, 1995-11 ,pp. :
Modular Termination Proofs for Rewriting Using Dependency Pairs
By Giesl J. Arts T. Ohlebusch E.
Journal of Symbolic Computation, Vol. 34, Iss. 1, 2002-07 ,pp. :
Modular aspects of term graph rewriting
Theoretical Computer Science, Vol. 208, Iss. 1, 1998-11 ,pp. :
Infinite normal forms for non-linear term rewriting systems
Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. :