𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Complexity of Artificial Grammars

✍ Scribed by Erik M. Bollt; Michael A. Jones

Book ID
110274924
Publisher
Springer
Year
2000
Tongue
English
Weight
99 KB
Volume
4
Category
Article
ISSN
1573-6652

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Nonterminal complexity of programmed gra
Nonterminal complexity of programmed grammars
✍ 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