ON THE DESCRIPTIONAL COMPLEXITY OF METALINEAR CD GRAMMAR SYSTEMS
2005 ◽
Vol 16
(05)
◽
pp. 1011-1025
Keyword(s):
Metalinear CD grammar systems are context-free CD grammar systems where each component consists of metalinear productions. The maximal number of nonterminals in all starting productions is referred to as the width of a CD grammar system. It is shown that between the class of CD grammar systems of width m + 1 and of width m there are savings concerning the size of the grammar system not bounded by any recursive function. This is called a non-recursive trade-off. Furthermore, it is proven that there are non-recursive trade-offs between the class of metalinear CD grammar systems of width m and the class of (2m - 1)-linear context-free grammars. In addition, some decidability results are presented.
Keyword(s):
2016 ◽
pp. 171-213
Keyword(s):
2013 ◽
Vol 24
(06)
◽
pp. 831-846
◽
Keyword(s):
2007 ◽
Vol 18
(06)
◽
pp. 1313-1322
2007 ◽
Vol 18
(06)
◽
pp. 1139-1149
◽
2019 ◽
Vol 8
(12)
◽
pp. 1281-1283
2009 ◽
Vol 20
(02)
◽
pp. 331-340
◽
Keyword(s):
2002 ◽
Vol 65
(2)
◽
pp. 393-414
◽
Keyword(s):