Author: Meduna A.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.246, Iss.1, 2000-09, pp. : 279-284
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
Nonterminal complexity of programmed grammars
By Fernau H.
Theoretical Computer Science, Vol. 296, Iss. 2, 2003-03 ,pp. :
Cooperation in context-free grammars
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :
On the degree of scattered context-sensitivity
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
A property of random context picture grammars
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :