P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
P Systems with Gemmation of Mobile Membranes
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
On the power of membrane division in P systems
Theoretical Computer Science - Words, languages and combinatorics
Universality results for P systems based on brane calculi operations
Theoretical Computer Science
On the Computational Power of Enhanced Mobile Membranes
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Turing Completeness Using Three Mobile Membranes
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
An overview of membrane computing
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Upper and lower bounds for the computational power of p systems with mobile membranes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
| Hi-index | 0.00 |
We continue the study of P systems with mobile membranes introduced in [6], which is a variant of P systems with active membranes having none of the features like polarizations, label change and division of non-elementary membranes. This variant was shown to be universal using only the simple operations of endocytosis and exocytosis; moreover, if elementary membrane division is allowed, it is capable of solving hard problems. Here, we investigate the power of the two operations (endocytosis, exocytosis) in more detail: 2 membranes can generate sets of vectors outside PsMAT, and four membranes give universality.