Author： Bouhoula A. Rusinowitch M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.275, Iss.1, 2002-03, pp. : 675-698
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
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. :
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. :
Deciding observational congruence of finite-state CCS expressions by rewriting
Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. :
Electronic Notes in Theoretical Computer Science, Vol. 4, Iss. 1, 2004-01 ,pp. :