Membrane Systems Languages Are Polynomial-Time Parsable
Close
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
1089 4
Ultima descărcare din IBN:
2020-10-06 18:41
Căutarea după subiecte
similare conform CZU
512.54+512.62 (1)
Algebra (400)
SM ISO690:2012
ALHAZOV, Artiom, CIUBOTARU, Constantin, IVANOV, Sergiu, ROGOZHIN, Yurii. Membrane Systems Languages Are Polynomial-Time Parsable. In: Computer Science Journal of Moldova, 2010, nr. 2(53), pp. 139-148. ISSN 1561-4042.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 2(53) / 2010 / ISSN 1561-4042 /ISSNe 2587-4330

Membrane Systems Languages Are Polynomial-Time Parsable
CZU: 512.54+512.62

Pag. 139-148

Alhazov Artiom12, Ciubotaru Constantin1, Ivanov Sergiu13, Rogozhin Yurii3
 
1 Institute of Mathematics and Computer Science ASM,
2 Hiroshima University,
3 Technical University of Moldova
 
Disponibil în IBN: 26 aprilie 2016


Rezumat

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

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'>
<dc:creator>Alhazov, A.E.</dc:creator>
<dc:creator>Ciubotaru, C..</dc:creator>
<dc:creator>Ivanov, S.V.</dc:creator>
<dc:creator>Rogojin, I.V.</dc:creator>
<dc:date>2010-06-05</dc:date>
<dc:description xml:lang='en'>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>
<dc:source>Computer Science Journal of Moldova 53 (2) 139-148</dc:source>
<dc:title>Membrane Systems Languages Are  Polynomial-Time Parsable</dc:title>
<dc:type>info:eu-repo/semantics/article</dc:type>
</oai_dc:dc>