Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement
Recently, it has been shown that every recursively enumerable language can be generated by a scattered context grammar with no more than three nonterminals. However, in that construction, the maximal number of nonterminals simultaneously rewritten during a derivation step depends on many factors, su...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Open Publishing Association
2009-07-01
|
| Col·lecció: | Electronic Proceedings in Theoretical Computer Science |
| Accés en línia: | http://arxiv.org/pdf/0907.5132v1 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|