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...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Open Publishing Association
2009-07-01
|
| Seri Bilgileri: | Electronic Proceedings in Theoretical Computer Science |
| Online Erişim: | http://arxiv.org/pdf/0907.5132v1 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|