Publisher： Academic Press
ISSN： 0022-0000
Source： Journal of Computer and System Sciences, Vol.60, Iss.2, 2000-04, pp. : 465-479
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
Improved matrix pair undecidability results
By Halava Vesa Hirvensalo Mika
Acta Informatica, Vol. 44, Iss. 3-4, 2007-07 ,pp. :
Two undecidability results for chain code picture languages
By Kim C.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
Some undecidability results concerning the property of preserving regularity
By Otto F.
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
Complexity parameters for first order classes
By Arias Marta
Machine Learning, Vol. 64, Iss. 1-3, 2006-09 ,pp. :