Formal languages
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
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
The power of mobility: four membranes suffice
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Membrane Systems with Peripheral Proteins: Transport and Evolution
Electronic Notes in Theoretical Computer Science (ENTCS)
Membrane computing and brane calculi. Old, new, and future bridges
Theoretical Computer Science
Decision problems in membrane systems with peripheral proteins, transport and evolution
Theoretical Computer Science
On the Computational Power of Flip-Flop Proteins on Membranes
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Letters: A variant of P systems for optimization
Neurocomputing
Membrane computing with transport and embedded proteins
Theoretical Computer Science
Mobility in computer science and in membrane systems
CMC'10 Proceedings of the 11th international conference on Membrane computing
Mutual mobile membranes with objects on surface
Natural Computing: an international journal
Mobile membranes with objects on surface as colored petri nets
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 5.23 |
Operations with membranes are essential both in brane calculi as well as in membrane computing. In this paper, we attempt to express six basic operations of brane calculi, viz., pino, exo, phago, bud, mate, drip in terms of the membrane computing formalism. We also investigate the computing power of P systems controlled by phago/exo, pino/exo, bud/mate as well as the mate/drip operations. We give an improvement to a characterization of RE using mate/drip operations given in [L. Cardelli, Gh. Paun, An universality result based on mate/drip operations, International Journal of Foundations of Computer Science (in press)]. We also give a characterization of RE using a new operation, called selective mate. We conjecture that it is not possible to obtain Turing completeness using only one of the six operations. We also conjecture that the pairs of operations we have considered for completeness, in this paper, are complete: it is impossible to obtain Turing completeness with any other pair of operations.