Author： Bravetti M. Aldini A.
Publisher： Elsevier
ISSN： 1571-0661
Source： Electronic Notes in Theoretical Computer Science, Vol.52, Iss.3, 2004-01, pp. : 1-29
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Previous Menu Next
Abstract
Related content
Kolmogorov complexity and non-determinism
Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. :
Access to resources
Recommend
Reducing non-determinism in right nulled GLR parsers
By Scott Elizabeth Johnstone Adrian
Acta Informatica, Vol. 40, Iss. 6-7, 2004-05 ,pp. :
On probabilistic timed automata
By Beauquier D.
Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. :
Probabilistic and prioritized models of timed CSP
By Lowe G.
Theoretical Computer Science, Vol. 138, Iss. 2, 1995-02 ,pp. :