, Volume 20, Issue 3, pp 295-305

The power of communication: P systems with symport/antiport

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


In the attempt to have a framework where the computation is done by communication only, we consider the biological phenomenon of trans-membrane transport of couples of chemicals (one say symport when two chemicals pass together through a membrane, in the same direction, and antiport when two chemicals pass simultaneously through a membrane, in opposite directions). Surprisingly enough, membrane systems without changing (evolving) the used objects and with the communication based on rules of this type are computationally complete, and this result is achieved even for pairs of communicated objects (as encountered in biology). Five membranes are used; the number of membranes is reduced to two if more than two chemicals may collaborate when passing through membranes.

Andrei Pâun: He graduated the Faculty of Mathematics of Bucharest University in 1998, received his M.Sc. degree from The University of Western Ontario in 1999, and since then he is a PhD student in the Computer Science Department of University of Western Ontario, London, Canada (under the guidance of prof. Sheng Yu). The topic of his thesis is Molecular Computing (especially, DNA and Membrane Computing), but his research interests also include neural networks, implementing automata, combinatorics on words.
Gheorghe Pâun: (the proud father of two sons, including the first author of this paper) He is a member of the Romanian Academy, working as a senior researcher in the Institute of Mathematics of the Romanian Academy, Bucharest, and as a Ramon y Cajal researcher in Rovira i Virgili University of Tarragona, Spain. He is one of the most active authors in (the theory of) DNA Computing, (co)author of many papers in this area, (co)author and (co)editor of several books. In 1998 he has initiated the area of Membrane Computing. Other research interests: regulated rewriting, grammar systems, contextual grammars, combinatorics on words, computational linguistics.