𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nonterminal complexity of tree controlled grammars

✍ Scribed by S. Turaev; J. Dassow; M. Selamat


Book ID
113927473
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
231 KB
Volume
412
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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

Tree controlled grammars
✍ K. Culik; H. A. Maurer πŸ“‚ Article πŸ“… 1977 πŸ› Springer Vienna 🌐 English βš– 551 KB