Author： Kristiansen L. Niggl K.-H.
Publisher： Elsevier
ISSN： 1571-0661
Source： Electronic Notes in Theoretical Computer Science, Vol.90, Iss.1, 2003-11, pp. : 15-35
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
A Refinement of the -measure for Stack Programs
Electronic Notes in Theoretical Computer Science, Vol. 90, Iss. 1, 2003-11 ,pp. :
Access to resources
Recommend
On the Computational Complexity of P Automata
By Csuhaj-Varjú Erzsébet Ibarra Oscar Vaszil György
Natural Computing, Vol. 5, Iss. 2, 2006-05 ,pp. :
Computational complexity of functions
By Levin L.A.
Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. :
On the computational complexity of infinite words
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
On computational complexity of contextual languages
By Ilie L.
Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. :