Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Computation: finite and infinite machines
Computation: finite and infinite machines
Counting time in computing with cells
DNA'05 Proceedings of the 11th international conference on DNA Computing
Computational power of symport/antiport: history, advances, and open problems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
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
Asynchronous p systems and p systems working in the sequential mode
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Communicative p systems with minimal cooperation
WMC'04 Proceedings of the 5th international conference on Membrane Computing
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
| Hi-index | 0.00 |
This work is a continuation of the investigations aiming to bridge membrane computing (where in a compartmental cell-like structure the chemicals to evolve are placed in the compartments defined by the membranes) and brane calculi (where one considers again a compartmental cell-like structure with the chemicals/proteins placed on the membranes themselves). In the current paper we use objects both in compartments and on membranes (the latter are called proteins), with the objects from membranes evolving under the control of the proteins. Several possibilities are considered (objects only moved across membranes or also changed during this operation, with the proteins only assisting the move/change or also changing themselves). Somewhat expected, computational universality is obtained for several combinations of such possibilities.