Skip to main content
SpringerLink
Log in

The power of communication: P systems with symport/antiport

  • Special Issue
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alberts, B., et al.,Essential Cell Biology. An Introduction to the Molecular Biology of the Cell, Garland Publ. Inc., New York, London, 1998.

    Google Scholar 

  2. Dassow, J. and Pâun, Gh.,Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.

    Book  Google Scholar 

  3. Martin-Vide, C., Pâun, Gh. and Rozenberg, G., “Membrane Systems with Carriers,”Theoretical Computer Science, 270, pp. 779–796, 2002.

    Article  MathSciNet  Google Scholar 

  4. Pâun, Gh., “Computing with Membranes,”Journal of Computer and System Sciences, 61, 1, pp. 108–143, 2000.

    Article  MathSciNet  Google Scholar 

  5. Handbook of Formal Languages (Rozenberg, G. and Salomaa, A., eds.), Springer-Verlag, Berlin, 1997.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Andrei Pâun

  2. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 70700, Bucureşti, Romania

    Gheorghe Pâun

Authors
  1. Andrei Pâun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gheorghe Pâun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrei Pâun.

Additional information

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.

About this article

Cite this article

Pâun, A., Pâun, G. The power of communication: P systems with symport/antiport. New Gener Comput 20, 295–305 (2002). https://doi.org/10.1007/BF03037362

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037362

Keywords

Search

Navigation