Minimal Parallelism and Number of Membrane Polarizations
It is known that the satisfiability problem ({\tt SAT}) can be efficiently solved by a uniform family of P systems with active membranes with two polarizations working in a maximally parallel way. We study P systems with active membranes without non-elementary membrane division, working in minimally...
Main Author: | Artiom Alhazov |
---|---|
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-(pp149-170).pdf |
Similar Items
-
Generating Languages by P Systems with Minimal Symport/Antiport
by: Artiom Alhazov, et al.
Published: (2006-12-01) -
Abstracts of Doctor Habilitatus Thesis
by: Artiom Alhazov
Published: (2013-11-01) -
Developments in Networks of Evolutionary Processors
by: Artiom Alhazov
Published: (2013-04-01) -
Communication in membrana Systems with symbol Objects.
by: Alhazov, Artiom
Published: (2006) -
Membrane Systems Languages Are Polynomial-Time Parsable
by: Artiom Alhazov, et al.
Published: (2010-11-01)