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...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Open Publishing Association
2009-07-01
|
| سلاسل: | Electronic Proceedings in Theoretical Computer Science |
| الوصول للمادة أونلاين: | http://arxiv.org/pdf/0907.5132v1 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|