Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 373-390
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
On logical and concurrent equivalences
By Bradfield J.C. Froschle S.B.
Electronic Notes in Theoretical Computer Science, Vol. 52, Iss. 1, 2004-01 ,pp. :
Access to resources
Recommend
On the decidability of process equivalences for the -calculus
By Dam M.
Theoretical Computer Science, Vol. 183, Iss. 2, 1997-09 ,pp. :
A family of NFAs which need 2 n - deterministic states
By Iwama K. Matsuura A. Paterson M.
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
Open maps, behavioural equivalences, and congruences
Theoretical Computer Science, Vol. 190, Iss. 1, 1998-01 ,pp. :