Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
1112 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 | ||||||
|
||||||
CZU: 512.54+512.62 | ||||||
Pag. 139-148 | ||||||
|
||||||
Descarcă PDF | ||||||
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 |
||||||
|
Google Scholar Export
<meta name="citation_title" content="Membrane Systems Languages Are Polynomial-Time Parsable"> <meta name="citation_author" content="Alhazov Artiom"> <meta name="citation_author" content="Ciubotaru Constantin"> <meta name="citation_author" content="Ivanov Sergiu"> <meta name="citation_author" content="Rogozhin Yurii"> <meta name="citation_publication_date" content="2010/06/05"> <meta name="citation_journal_title" content="Computer Science Journal of Moldova"> <meta name="citation_volume" content="53"> <meta name="citation_issue" content="2"> <meta name="citation_firstpage" content="139"> <meta name="citation_lastpage" content="148"> <meta name="citation_pdf_url" content="https://ibn.idsi.md/sites/default/files/imag_file/Membrane%20Systems%20Languages%20Are%20Polynomial-Time%20Parsable.pdf">