| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437305 | Theoretical Computer Science | 2011 | 7 Pages |
Abstract
This paper studies the nonterminal complexity of tree controlled grammars. It is proved that the number of nonterminals in tree controlled grammars without erasing rules leads to an infinite hierarchy of families of tree controlled languages, while every recursively enumerable language can be generated by a tree controlled grammar with erasing rules and at most nine nonterminals.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
