Membrane Systems with Coupled Transport: Universality and Normal Forms

Authors:
Carlos Martín-Vide;Andrei Păun;Gheorghe Păun;Grzegorz Rozenberg
Affiliations:
Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005 Tarragona, Spain;Department of Computer Science, University of Western Ontario, London, Ontario, Canada N6A 5B7;Institute of Mathematics of the Romanian Academy, PO Box 1-764, 70700 Bucureşti, Romania;Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands
Venue:
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Year:
2002

Citing 9
Cited 0

Computing with membranes

Journal of Computer and System Sciences
Handbook of Formal Languages

Handbook of Formal Languages
Membrane systems with carriers

Theoretical Computer Science
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
A guide to membrane computing

Theoretical Computer Science - Natural computing
The power of communication: P systems with symport/antiport

New Generation Computing
Computing with Membranes: Attacking NP-Complete Problems

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Solving NP-Complete Problems Using P Systems with Active Membranes

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper continues research on membrane systems which function by communication only, meaning that there are no evolving rules for molecules. The whole computation process relies on passage of molecules through membranes -- this provides communication between regions of the membrane system. Next to transport of single molecules through membranes (uniport) we also study a coupled transport of molecules, with two molecules passing either in the same direction (symport) or in opposite directions (antiport). We study the computational power of such membrane systems and prove that using only symport one gets Turing universality. Moreover, we prove that five membranes suffice to get Turing universality, and the number of membranes can be decreased to three if forbidding context conditions for transport are used.