Author： Esik Z. Labella A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.195, Iss.1, 1998-03, pp. : 61-89
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 complete equational axiomatization for MPA with string iteration
Theoretical Computer Science, Vol. 211, Iss. 1, 1999-01 ,pp. :
Access to resources
Recommend
Equational properties of Kleene algebras of relations with conversion
Theoretical Computer Science, Vol. 137, Iss. 2, 1995-01 ,pp. :
Scott Induction and Equational Proofs
Electronic Notes in Theoretical Computer Science, Vol. 1, Iss. 1, 2004-01 ,pp. :
An equational notion of lifting monad
By Bucalo A. Fuhrmann C. Simpson A.
Theoretical Computer Science, Vol. 294, Iss. 1, 2003-02 ,pp. :
Equational axiomatizability for coalgebra
By Rosu
Theoretical Computer Science, Vol. 260, Iss. 1, 2001-06 ,pp. :