| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427963 | Information Processing Letters | 2010 | 6 Pages |
Abstract
By showing that two nonterminals are sufficient, we present the optimal lower bound on the number of nonterminals of scattered context grammars being able to generate any recursively enumerable language.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
