Membrane Systems Languages Are Polynomial-Time Parsable

ALHAZOV, Artiom; CIUBOTARU, Constantin; IVANOV, Sergiu; ROGOZHIN, Yurii

dc.contributor.author	ALHAZOV, Artiom
dc.contributor.author	CIUBOTARU, Constantin
dc.contributor.author	IVANOV, Sergiu
dc.contributor.author	ROGOZHIN, Yurii
dc.date.accessioned	2020-10-07T08:26:11Z
dc.date.available	2020-10-07T08:26:11Z
dc.date.issued	2010
dc.identifier.citation	ALHAZOV, Artiom, CIUBOTARU, Constantin, IVANOV, Sergiu et al. Membrane Systems Languages Are Polynomial-Time Parsable. In: Computer Science Journal of Moldova. 2010, nr. 2(53), pp. 139-148. ISSN 1561-4042.	en_US
dc.identifier.uri	http://repository.utm.md/handle/5014/10494
dc.description.abstract	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.
dc.description.sponsorship	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.	en_US
dc.language.iso	en	en_US
dc.publisher	Institutul de Matematică şi Informatică al AŞM	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	family of languages	en_US
dc.subject	grammar	en_US
dc.subject	membrane systems languages	en_US
dc.subject	polynomial time	en_US
dc.title	Membrane Systems Languages Are Polynomial-Time Parsable	en_US
dc.type	Article	en_US