Author： Cheng A. Esparza J. Palsberg J.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.147, Iss.1, 1995-08, pp. : 117-136
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
Complexity Results on Learning by Neural Nets
By Lin J-H.
Machine Learning, Vol. 06, Iss. 3, 1991-05 ,pp. :
Access to resources
Recommend
Control of Safe Ordinary Petri Nets Using Unfolding
By Giua Alessandro Xie Xiaolan
Discrete Event Dynamic Systems, Vol. 15, Iss. 4, 2005-12 ,pp. :
Deciding true concurrency equivalences on safe, finite nets
Theoretical Computer Science, Vol. 154, Iss. 1, 1996-01 ,pp. :
On the complexity of deadlock detection in families of planar nets
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :
Complexity results for triangular sets
By Schost E.
Journal of Symbolic Computation, Vol. 36, Iss. 3, 2003-09 ,pp. :