Nonterminal complexity of programmed gra
โ
Henning Fernau
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 228 KB
We show that, in the case of context-free programmed grammars with appearance checking working under free derivations, three nonterminals are enough to generate every recursively enumerable language. This improves the previously published bound of eight for the nonterminal complexity of these gramma