Author： Stirling C.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.195, Iss.2, 1998-03, pp. : 113-131
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
Branching time and orthogonal bisimulation equivalence
By Bergstra J.A. Ponse A. van der Zwaag M.B.
Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. :
Access to resources
Recommend
Decidability of behavioural equivalence in unary PCF
Theoretical Computer Science, Vol. 216, Iss. 1, 1999-03 ,pp. :
Decidability of equivalence for deterministic synchronized tree automata
By Salomaa K.
Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. :
Decidability of EDT0L structural equivalence
By Salomaa K. Yu S.
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :
Deciding bisimulation-like equivalences with finite-state processes
By Jancar
Theoretical Computer Science, Vol. 258, Iss. 1, 2001-05 ,pp. :