Author： Caporaso S. Zito M. Galesi N.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.250, Iss.1, 2001-01, pp. : 83-99
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
Probabilistic weak simulation is decidable in polynomial time
By Baier C. Hermanns H. Katoen J.-P.
Information Processing Letters, Vol. 89, Iss. 3, 2004-02 ,pp. :
Access to resources
Recommend
Polynomial Time Learnability of Simple Deterministic Languages
By Ishizaka H.
Machine Learning, Vol. 05, Iss. 2, 1990-06 ,pp. :
A Polynomial-Time Parsing Algorithm for K -Depth Languages
Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. :
Coalgebraic Reasoning about Classes in Object-Oriented Languages
By Jacobs B.
Electronic Notes in Theoretical Computer Science, Vol. 11, Iss. 1, 2004-01 ,pp. :