Author： Kulkarni S.R. Shankar P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.165, Iss.2, 1996-10, pp. : 355-390
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
The Boolean closure of linear context-free languages
Acta Informatica, Vol. 45, Iss. 3, 2008-05 ,pp. :
Access to resources
Recommend
Ambiguity in omega context free languages
By Finkel O.
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
Length considerations in context-free languages
By Raz D.
Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. :
On lengths of words in context-free languages
By Ilie
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
Growth-sensitivity of context-free languages
By Ceccherini-Silberstein T. Woess W.
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :