Author： Ilie L.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.183, Iss.1, 1997-08, pp. : 33-44
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
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. :
The counting complexity of group-definable languages
By Arvind V. Vinodchandran N.V.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :