Skip to main content
SpringerLink
Log in

Universality of Minimal Symport/Antiport: Five Membranes Suffice

  • Conference paper
Membrane Computing (WMC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2933))

Included in the following conference series:

Abstract

P systems with symport/antiport rules of a minimal size (only one object passes in any direction in a communication step) have been recently proved to be computationally universal. The result originally reported in [2] has been subsequently improved in [6] by showing that six membranes suffice. In [6] it has been also conjectured that at least one membrane can be saved. Here we prove that conjecture: P systems with five membranes and symport/antiport rules of a minimal size are computationally complete. The optimality of this result remains open.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., Walter, P.: The Molecular Biology of The Cell, 4th edn. Garland Publ. Inc., London (2002)

    Google Scholar 

  2. Bernardini, F., Gheorghe, M.: On the Power of Minimal Symport/Antiport. In: Alhazov, A., Martin-Vide, C., Păun, Gh. (eds.): Workshop on Membrane Computing, WMC-2003, Tarragona, July 17–22, Technical Report N. 28/03, Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, pp. 72–83 (2003)

    Google Scholar 

  3. Freund, R., Păun, A.: Membrane Systems with Symport/Antiport: Universality Results. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 270–287. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Frisco, P., Hoogeboom, J.H.: Simulating Counter Automata by P Systems with Symport/Antiport. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 288–301. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Hopcroft, J., Ulmann, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  6. Kari, L., Martin-Vide, C., Păun, A.: On the Universality of P Systems with Minimal Symport/Antiport Rules (2003) (submitted)

    Google Scholar 

  7. Martin-Vide, C., Păun, A., Păun, G.: On the Power of P Systems with Symport and Antiport Rules. Journal of Universal Computer Science 8, 317–331 (2002)

    Google Scholar 

  8. Păun, A., Păun, G.: The Power of Communication: P Systems with Symport/ Antiport. New Generation Computing 20, 295–305 (2002)

    Article  MATH  Google Scholar 

  9. Păun, G.: Computing with Membranes. Journal of Computer and System Sciences 61, 108–143 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)

    MATH  Google Scholar 

  11. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1–3. Springer, Berlin (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Sheffield, Regent Court, Portobello Street, Sheffield, S1 4DP, UK

    Francesco Bernardini

  2. Department of Computer Science, Louisiana Tech University, Ruston, P.O. Box 10137, Louisiana, LA-71272, USA

    Andrei Păun

Authors
  1. Francesco Bernardini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrei Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group in Mathematical Linguistics, Rovira i Virgili University, Pça, Imperial Tarraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Complex Systems and Artificial Intelligence Research Center, University of Milan–Bicocca, Italy

    Giancarlo Mauri

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

    Gheorghe Păun

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  5. Turku Centre for Computer Science (TUCS), Leminkäisenkatu 14, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernardini, F., Păun, A. (2004). Universality of Minimal Symport/Antiport: Five Membranes Suffice. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2003. Lecture Notes in Computer Science, vol 2933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24619-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24619-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20895-2

  • Online ISBN: 978-3-540-24619-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation