Author： Asveld P.R.J.P.R.J. Nijholt A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.230, Iss.1, 2000-01, pp. : 247-256
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
Length considerations in context-free languages
By Raz D.
Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. :
Access to resources
Recommend
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. :
A hierarchy of deterministic context-free -languages
By Duparc J.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Undecidability of the trace coding problem and some decidable cases
By Kunc M.
Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. :