Formal languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Membrane Computing: An Introduction
Membrane Computing: An Introduction
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
P Systems with Mobile Membranes
Natural Computing: an international journal
Computation: finite and infinite machines
Computation: finite and infinite machines
Describing the Immune System Using Enhanced Mobile Membranes
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Computational Power of Enhanced Mobile Membranes
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Simple, Enhanced and Mutual Mobile Membranes
Transactions on Computational Systems Biology XI
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
The power of mobility: four membranes suffice
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
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
Reachability problems in BioAmbients
Theoretical Computer Science
| Hi-index | 0.00 |
The mutual mobile membrane systems represent a variant of mobile membrane systems in which the endocytosis and exocytosis work whenever the involved membranes "agree" on the movement (this agreement is described by using dual objects a and $\overline{a}$ in the involved membranes). We study the computational power of this variant of mobile membrane systems, proving that only three membranes are enough to get the same computational power as a Turing machine.