Skip to main content
SpringerLink
Log in

Membrane Systems with Symport/Antiport Rules: Universality Results

  • Conference paper
  • First Online:
Membrane Computing (WMC 2002)

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

Included in the following conference series:

Abstract

Symport and antiport are biological ways for transporting molecules through membranes in a “collaborating” manner; in the case of symport several molecules pass in the same direction, in the case of antiport two or more molecules pass in opposite directions. In this paper we first survey the results on the computing power of membrane systems (P systems) using only symport/antiport rules and then improve some of the results known so far. A recent variant of P systems with purely communicating rules introduced in [24] with the name of communicating P systems is revisited and optimal (with respect to the number of membranes) universality results for that particular variant are obtained, too.

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., et al.: Essential Cell Biology. An Introduction to the Molecular Biology of the Cell. Garland Publ. Inc., New York, London (1998)

    Google Scholar 

  2. Calude, C. S., Păun, Gh.: Computing with Cells and Atoms. Taylor & Francis, London (2001)

    MATH  Google Scholar 

  3. Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin (1989)

    Google Scholar 

  4. Freund, R., Oswald, M.: GP Systems with Forbidding Context. Fundamenta Informaticae 49, 1–3 (2002) 81–102

    MathSciNet  MATH  Google Scholar 

  5. Freund, R., Oswald, M.: P Systems with Activated/Prohibited Membrane Channels, this volume

    Google Scholar 

  6. Freund, R., Păun, Gh.: On the Number of Non-terminals in Graph-controlled, Programmed, and Matrix Grammars. In: Margenstern, M., Rogozhin, Y. (eds.): Proc. Conf. Universal Machines and Computations, Chişinău (2001). Springer-Verlag, Berlin (2001)

    Google Scholar 

  7. Freund, R., Păun, Gh.: From Regulated Rewriting to Computing with Membranes: Collapsing Hierarchies; to appear in TCS

    Google Scholar 

  8. Frisco, P., Hoogeboom, H. J.: Simulating Counter Automata by P Systems with Symport/Antiport. In: [21] 237–248

    Google Scholar 

  9. Martin-Vide, C., Păun, A., Păun, Gh.: On the Power of P Systems with Symport Rules. J. Universal Computer Sci. 8 2 (2002) 317–331

    Google Scholar 

  10. Martin-Vide, C., Păun, A., Păun, Gh., Rozenberg, G.: Membrane Systems with Coupled Transport: Universality and Normal Forms. Fundamenta Informaticae 49, 1–3 (2002) 1–15

    MathSciNet  MATH  Google Scholar 

  11. Martin-Vide, C., Păun, Gh.: Elements of Formal Language Theory for Membrane Computing. Technical Report 21/01 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona (2001)

    Google Scholar 

  12. Minsky, M. L.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, New Jersey (1967)

    MATH  Google Scholar 

  13. Păun, A., Păun, Gh.: The Power of Communication: P Systems with Symport/Antiport. New Generation Computing 20, 3 (2002) 295–306

    Article  MATH  Google Scholar 

  14. Păun, A., Păun, Gh., Rodriguez-Paton, A.: Further Remarks on P Systems with Symport Rules. Ann. Univ. Al.I. Cuza, Iaşi 10 (2001) 3–18

    MATH  Google Scholar 

  15. Păun, A., Păun, Gh., Rozenberg, G.: Computing by Communication in Networks of Membranes. International Journal of Foundations of Computer Science (2002) accepted

    Google Scholar 

  16. Păun, Gh.: Computing with Membranes. Journal of Computer and System Sciences 61, 1 (2000) 108–143, and TUCS Research Report 208 (1998) (http://www.tucs.fi)

    Article  MathSciNet  MATH  Google Scholar 

  17. Păun, Gh.: Computing with Membranes: An Introduction. Bulletin EATCS 67 (1999) 139–152

    MATH  Google Scholar 

  18. Păun, Gh.: Membrane Computing: An Introduction. Springer-Verlag, Berlin (2002)

    Book  MATH  Google Scholar 

  19. Păun, Gh., Perez-Jimenez, M., Sancho-Caparrini, F.: On the Reachability Problem for P Systems with Symport/Antiport. 10th Intern. Conf. on Automata and Formal Languages, Debrecen, 2002

    Google Scholar 

  20. Păun, Gh., Zandron, C. (eds.): Pre-Proceedings of Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Argeş, Romania (2002)

    Google Scholar 

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

    MATH  Google Scholar 

  22. Sosík, P.: P Systems Versus Register Machines: Two Universality Proofs. In: [21] 371–382

    Google Scholar 

  23. Sosík, P., Matysek, J.: Membrane Computing: When Communication is Enough. In: Calude, C. S., Dinneen, M. J., Peper, F. (eds.): Unconventional Models of Computation 2002, LNCS 2509, Springer-Verlag, Berlin (2002) 264–275

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technische Universität Wien, Karlsplatz 13, A-1040, Wien, Austria

    Rudolf Freund

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

    Andrei PĂun

Authors
  1. Rudolf Freund
    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. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe PĂun

  2. Leiden University, Leiden Institute of Advanced Computer Science, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

  4. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Via Bicocca degli Arcimboldi, 8, 20126, Milano, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freund, R., PĂun, A. (2003). Membrane Systems with Symport/Antiport Rules: Universality Results. In: PĂun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36490-0_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-36490-0_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00611-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation