Author: Sedoglavic A.
Publisher: Academic Press
ISSN: 0747-7171
Source: Journal of Symbolic Computation, Vol.33, Iss.5, 2002-05, pp. : 735-755
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. :
A Polynomial-Time Parsing Algorithm for K -Depth Languages
Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. :