Membrane Systems Languages Are Polynomial-Time Parsable

Membrane Systems Languages Are Polynomial-Time Parsable

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 polyn...

Full description

Bibliographic Details
Main Authors: Artiom Alhazov, Constantin Ciubotaru, Sergiu Ivanov, Yurii Rogozhin
Format: Article
Language:English
Published: Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova 2010-11-01
Series:Computer Science Journal of Moldova
Online Access:http://www.math.md/files/csjm/v18-n2/v18-n2-(pp139-148).pdf
id doaj-764ac599842945f886ec5cb86a4b3fcb
record_format Article
spelling doaj-764ac599842945f886ec5cb86a4b3fcb2020-11-25T00:41:10ZengInstitute of Mathematics and Computer Science of the Academy of Sciences of MoldovaComputer Science Journal of Moldova1561-40422010-11-01182(53)139148Membrane Systems Languages Are Polynomial-Time ParsableArtiom Alhazov0Constantin Ciubotaru1Sergiu Ivanov2Yurii Rogozhin3 Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, 5 Academiei str., Chisinau, MD-2028, Moldova; FCS, Department of Information Engineering Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima 739-8527 Japan Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, 5 Academiei str., Chisinau, MD-2028, Moldova Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, 5 Academiei str., Chisinau, MD-2028, Moldova; Faculty of Computers, Informatics and Microelectronics, Technical University of Moldova, Stefan cel Mare 168, Chisinau MD-2004 Moldova Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, 5 Academiei str., Chisinau, MD-2028, MoldovaThe 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.http://www.math.md/files/csjm/v18-n2/v18-n2-(pp139-148).pdf
collection DOAJ
language English
format Article
sources DOAJ
author Artiom Alhazov
Constantin Ciubotaru
Sergiu Ivanov
Yurii Rogozhin
spellingShingle Artiom Alhazov
Constantin Ciubotaru
Sergiu Ivanov
Yurii Rogozhin
Membrane Systems Languages Are Polynomial-Time Parsable
Computer Science Journal of Moldova
author_facet Artiom Alhazov
Constantin Ciubotaru
Sergiu Ivanov
Yurii Rogozhin
author_sort Artiom Alhazov
title Membrane Systems Languages Are Polynomial-Time Parsable
title_short Membrane Systems Languages Are Polynomial-Time Parsable
title_full Membrane Systems Languages Are Polynomial-Time Parsable
title_fullStr Membrane Systems Languages Are Polynomial-Time Parsable
title_full_unstemmed Membrane Systems Languages Are Polynomial-Time Parsable
title_sort membrane systems languages are polynomial-time parsable
publisher Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
series Computer Science Journal of Moldova
issn 1561-4042
publishDate 2010-11-01
description 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.
url http://www.math.md/files/csjm/v18-n2/v18-n2-(pp139-148).pdf
work_keys_str_mv AT artiomalhazov membranesystemslanguagesarepolynomialtimeparsable
AT constantinciubotaru membranesystemslanguagesarepolynomialtimeparsable
AT sergiuivanov membranesystemslanguagesarepolynomialtimeparsable
AT yuriirogozhin membranesystemslanguagesarepolynomialtimeparsable
_version_ 1725286939777564672

Similar Items