Author： Wijesekera D. Ganesh M. Srivastava J. Nerode A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.266, Iss.1, 2001-09, pp. : 365-405
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
Algebraic proofs of consistency and completeness
Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,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. :
Normal forms for algebras of connections
By Bruni R. Gadducci F. Montanari U.
Theoretical Computer Science, Vol. 286, Iss. 2, 2002-09 ,pp. :
Normal forms of quasiperiodic strings
By Mouchard
Theoretical Computer Science, Vol. 249, Iss. 2, 2000-10 ,pp. :
On the Modularity of Normal Forms in Rewriting
By Marchiori M.
Journal of Symbolic Computation, Vol. 22, Iss. 2, 1996-02 ,pp. :