Skip to main content
SpringerLink
Log in

About P systems with symport/antiport

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

It is proved that four membranes suffice to a variant of P systems with symport/antiport with maximal parallelism to generate all recursively enumerable sets of numbers. P systems with symport/antiport without maximal parallelism are also studied, considering two termination criteria.

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

  • Alhazov A, Martin-Vide C, Păun Gh (eds) (2003) PreProcedings of Workshop on Membrane Computing, WMC-2003, Tarragona, July 17–22, 2003. Technical Report, 28/03, Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona

  • Bernardini F, Gheorghe M (2003) On the power of minimal symport/antiport. 1:72–83

  • Bernardini F, Păun A (2004) Universality of minimal symport/antiport: Five membranes suffices. 7:43–54

  • Frisco P (2004) The conformon-P system: A molecular and cell biology-inspired comutability model. Theoretical Computer Science 312(2–3):295–319

    Google Scholar 

  • Frisco P, Hoogeboom HJ accepted Acta Informaticae P systems with symport/antiport simulating counter automata

  • Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages, and computation. Addison-Wesley, Reading Mass.

  • Jonoska N, Păun Gh, Rozenberg G (eds) (2004) Aspects of molecular computing: Essays dedicated to Tom Head, on the occasion of his 70th birthday. Lecture Notes in Computer Science 2950, Springer, Berlin Heidelberg New York

  • Kari L, Martin-Vide C, Păun A (2004) On the universality of P systems with minimal symport/antiport rules. 7:254–265.

  • Martin-Vide C, Păun A, Păun Gh (2002) On the power of P systems with symport rules. The Journal of Universal Computer Science 8:317–331

    Google Scholar 

  • Martin-Vide C, Păun A, Păun Gh, Rozenberg G (2002) Membrane systems with coupled transport: universality and normal forms. Fundamenta Informaticae 49:1–15

  • Minsky ML (1961) Recursive unsolvability of Post’s problem of “tag” and other topics in theory of Turing machines. Annals of Mathematics 74(3):437–455

    Google Scholar 

  • Păun A, Păun Gh (2002) The power of communication: P systems with symport/antiport. New Generation Computing 20(3):295–306

  • Păun Gh (2000) Computing with membranes. Journal of Computer and System Sciences 1(61):108–143

    Google Scholar 

  • Păun Gh (2002) Membrane computing. An introduction. Springer, Berlin Heidelberg New York

  • Păun Gh, Yu S (1999) On synchronization in P systems. Fundamenta Informaticae 34(4):397–410

Download references

Author information

Authors and Affiliations

  1. Leiden University, LIACS, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Pierluigi Frisco

Authors
  1. Pierluigi Frisco
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pierluigi Frisco.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Frisco, P. About P systems with symport/antiport. Soft Comput 9, 664–672 (2005). https://doi.org/10.1007/s00500-004-0396-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-004-0396-1

Keywords

Search

Navigation