Author： Regan K.W. Vollmer H.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.188, Iss.1, 1997-11, pp. : 101-116
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
Undecidability Results for Low Complexity Time Classes
Journal of Computer and System Sciences, Vol. 60, Iss. 2, 2000-04 ,pp. :
Access to resources
Recommend
Linear time parsers for classes of non context free languages
Theoretical Computer Science, Vol. 165, Iss. 2, 1996-10 ,pp. :
On computational complexity of contextual languages
By Ilie L.
Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. :
Complexity parameters for first order classes
By Arias Marta
Machine Learning, Vol. 64, Iss. 1-3, 2006-09 ,pp. :
The structure of logarithmic advice complexity classes
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :