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...
| Main Authors: | , , , |
|---|---|
| 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 |