Skip to main content
SpringerLink
Log in

On the power and size of extended gemmating P systems

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

Abstract

In [3] P systems with gemmation of mobile membranes were examined. It was shown that (extended) systems with eight membranes are as powerful as the Turing machines. Moreover, it was proved that extended gemmating P systems with only pre-dynamical rules are still computationally complete: in this case nine membranes are needed to obtain this computational power. In this paper we improve the above results concerning the size bound of extended gemmating P systems, namely we prove that these systems with at most five membranes (with meta-priority relations and without communication rules) form a class of universal computing devices, while in the case of extended systems with only pre-dynamical rules six membranes are enough to determine any recursively enumerable language.

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

  • Besozzi D (2003) Computational and modelling power of P systems. PhD dissertation, University of Milano

  • Besozzi D, Csuhaj-Varjú E, Mauri G, Zandron C (2004) Size and power of extending gemmating P systems. In: Păun G, Riscos-Núñez A, Romero-Jiménez A, Sancho-Caparrini F (eds) Proc. Second Brainstorming Week on Membrane Computing, Sevilla, 2-7 February 2004, TR 01/2004, Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, 92–101

  • Besozzi D, Mauri G, Păun G, Zandron C (2003) Gemmating P systems: collapsing hierarchies. Theoretical Computer Science 296(2): 253–267

  • Besozzi D, Zandron C, Mauri G, Sabadini N (2001) P systems with gemmation of mobile membranes. In: Restivo A, Ronchi Della Rocca S, Roversi L (eds) Proceedings of the 7th Italian Conference of Theoretical Computer Science 2001, Lecture Notes in Computer Science 2202, Springer, Berlin, 136–153

  • Păun G (2002) Membrane computing. An introduction. Springer, Berlin

  • Rothman JE, Orci L (1996) Budding vesicles in cells. Scientific American 274(3): 70–75

  • Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages. Springer, Berlin

  • Voet D, Voet JG (1995) Biochemistry, 2nd edn. John Wiley and Sons, Inc.

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano, Via Comelico 39, 20135, Milano, Italy

    Daniela Besozzi

  2. Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende u. 13-17, H-1111, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

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

    Giancarlo Mauri & Claudio Zandron

Authors
  1. Daniela Besozzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erzsébet Csuhaj-Varjú
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giancarlo Mauri
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Claudio Zandron
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daniela Besozzi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Besozzi, D., Csuhaj-Varjú, E., Mauri, G. et al. On the power and size of extended gemmating P systems. Soft Comput 9, 650–656 (2005). https://doi.org/10.1007/s00500-004-0394-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-004-0394-3

Keywords

Search

Navigation