| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436291 | Theoretical Computer Science | 2009 | 5 Pages |
Abstract
This paper proves that every recursively enumerable language is generated by a scattered context grammar with no more than four nonterminals and three non-context-free productions. In its conclusion, it gives an overview of the results and open problems concerning scattered context grammars and languages.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
