Author： Turakainen P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.174, Iss.1, 1997-03, pp. : 269-274
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
Some undecidability results concerning the property of preserving regularity
By Otto F.
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
Access to resources
Recommend
Undecidability of bisimilarity for Petri nets and some related problems
By Jancar P.
Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. :
Undecidability of the trace coding problem and some decidable cases
By Kunc M.
Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. :
Approximation of some NP-hard optimization problems by finite machines, in probability
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :