Membrane computing with external output
Fundamenta Informaticae
Journal of Computer and System Sciences
Membrane systems with coupled transport: universality and normal forms
Fundamenta Informaticae - Membrane computing
The relevance of cell membranes for P Systems: general aspects
Fundamenta Informaticae - Membrane computing
The power of communication: P systems with symport/antiport
New Generation Computing
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Simulating Counter Automata by P Systems with Symport/Antiport
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
On sets of numbers accepted by P/T systems composed by join
Theoretical Computer Science
A novel variant of p systems for the modelling and simulation of biochemical systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Hi-index | 0.00 |
Symport and antiport are biological ways of transporting molecules through membranesin ``collaborating'' pairs; in the case of symport the two molecules pass in the same direction, in the case of antiport the two molecules pass in opposite directions. Here we first survey the results about the computing power of membrane systems (P systems) using only symport/antiport rules (hence these systems compute by communication only), then we consider a recently introduced, way of defining the result of a computation in a membrane system: looking for the trace of certain objects in their movement through membranes. Rather unexpected, in this way we get characterizations of recursively enumerable languages by means of membrane systems with symport/antiport which work with multisets of objects (note the qualitative difference between the data structure used by computations – multisets: no ordering– and the data structure of the output – strings: linear ordering). A similar remark holds true for the case of analysing P systems, which work in an automata-like manner: the sequence of certain distinguished objects taken from the environment during acomputation is the string recognized by the computation. We also survey universality results from this area, with sketched proofs. Some open problems are also formulated.