Author： Choffrut C. Harju T. Karhumaki J.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.183, Iss.1, 1997-08, pp. : 83-92
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
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. :
Decidability problems in grammar systems
By Mihalache V.
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :
By Campbell C.M. Robertson E.F. Ruskuc N. Thomas R.M.
Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. :
Frontier between decidability and undecidability: a survey
Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. :