Author： Ceccherini-Silberstein T. Woess W.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.307, Iss.1, 2003-09, pp. : 103-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
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. :
A hierarchy of deterministic context-free -languages
By Duparc J.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
The Boolean closure of linear context-free languages
Acta Informatica, Vol. 45, Iss. 3, 2008-05 ,pp. :
Topological properties of omega context-free languages
By Finkel O.
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :