Formal languages
Grammars with controlled derivations
Handbook of formal languages, vol. 2
Journal of Computer and System Sciences
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
P Systems with Mobile Membranes
Natural Computing: an international journal
Universality results for P systems based on brane calculi operations
Theoretical Computer Science
P Systems with Proteins on Membranes
Fundamenta Informaticae
On the computational power of the mate/bud/drip brane calculus: interleaving vs. maximal parallelism
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the computational power of brane calculi
Transactions on Computational Systems Biology VI
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
An overview of membrane computing
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
| Hi-index | 5.23 |
In this paper, we look at the expressive power of P systems with proteins embedded on the membranes. The rules governing the evolution of the embedded proteins are inspired from brane calculi. We use some basic operations of brane calculi, namely, exo, endo, bud, mate, pino, wrap in the formalism of membrane computing. We also use rules allowing the movement of proteins, to pass through membranes and attach to and detach from the membranes. Combining the two kinds of operations, namely, brane calculi operations as well as protein movement operations, we have obtained some universality results of P systems. We have also identified some decidable sub-classes of P systems by restricting the use of the protein movement rules.