文章基本信息

标题：Membrane Systems Languages Are Polynomial-Time Parsable
本地全文：下载
作者：Alhazov Artiom ; Ciubotaru Constantin ; Ivanov Sergiu 等
期刊名称：Computer Science Journal of Moldova
印刷版ISSN：1561-4042
出版年度：2010
卷号：18
期号：2
页码：139-148
出版社：Institute of Mathematics and Computer Science
摘要：The focus of this paper is the family of languages generated by transitional non-cooperative P systems without further ingredients. This family can also be defined by so-called time yields of derivation trees of context-free grammars. In this paper we prove that such languages can be parsed in polynomial time, where the degree of polynomial may depend on the number of rules and on the size of the alphabet.