Další formáty:
BibTeX
LaTeX
RIS
@article{800087, author = {Masopust, Tomáš}, article_location = {Amsterdam, North Holland}, keywords = {scattered context grammar; descriptional complexity}, issn = {0304-3975}, journal = {Theoretical Computer Science}, title = {On the Descriptional Complexity of Scattered Context Grammars}, url = {http://dx.doi.org/10.1016/j.tcs.2008.10.017}, volume = {410}, year = {2009} }
TY - JOUR ID - 800087 AU - Masopust, Tomáš PY - 2009 TI - On the Descriptional Complexity of Scattered Context Grammars JF - Theoretical Computer Science VL - 410 SP - 108-112 EP - 108-112 PB - Elsevier Science Publishers SN - 03043975 KW - scattered context grammar KW - descriptional complexity UR - http://dx.doi.org/10.1016/j.tcs.2008.10.017 N2 - 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. ER -
MASOPUST, Tomáš. On the Descriptional Complexity of Scattered Context Grammars. \textit{Theoretical Computer Science}. Amsterdam, North Holland: Elsevier Science Publishers, 2009, roč.~410, s.~108-112. ISSN~0304-3975.
|