Author： Kunc M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.310, Iss.1, 2004-01, pp. : 393-456
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
Some decidable results on reachability of solvable systems
By Xu Ming
International Journal of General Systems, Vol. 42, Iss. 4, 2013-05 ,pp. :
Undecidability of bisimilarity for Petri nets and some related problems
By Jancar P.
Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. :
Some undecidability results concerning the property of preserving regularity
By Otto F.
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
The homomorphism problem for trace monoids
By Silva P.V.
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :