Author： Mocas S.E.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.158, Iss.1, 1996-05, pp. : 221-231
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
Gap-languages and log-time complexity classes
Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. :
Access to resources
Recommend
Undecidability Results for Low Complexity Time Classes
Journal of Computer and System Sciences, Vol. 60, Iss. 2, 2000-04 ,pp. :
Linear time parsers for classes of non context free languages
Theoretical Computer Science, Vol. 165, Iss. 2, 1996-10 ,pp. :
Some classes of prolog programs inferable from positive data
By Rao M.R.K.K.
Theoretical Computer Science, Vol. 241, Iss. 1, 2000-06 ,pp. :
Separation of uniform learning classes
By Zilles S.
Theoretical Computer Science, Vol. 313, Iss. 2, 2004-02 ,pp. :