Author： Gilman R.H.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.163, Iss.1, 1996-08, pp. : 277-281
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 shrinking lemma for random forbidding context languages
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
Access to resources
Recommend
A pumping lemma for random permitting context languages
By Ewert
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
By Zenger C.
Theoretical Computer Science, Vol. 187, Iss. 1, 1997-11 ,pp. :
Reference list of indexed articles
Theoretical Computer Science, Vol. 150, Iss. 2, 1995-01 ,pp. :
A syntactical proof of the Marriage Lemma
By Coquand T.
Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. :