On the power and size of extended gemmating P systems

Daniela Besozzi, Erzsébet Csuhaj-Varjú, Giancarlo Mauri, Claudio Zandron

Research output: Contribution to journalArticle


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.

Original languageEnglish
Pages (from-to)650-656
Number of pages7
JournalSoft Computing
Issue number9
Publication statusPublished - Sep 1 2005



  • Geffert normal form
  • Gemmation
  • Membrane computing
  • Recursively enumerable Language

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Geometry and Topology

Cite this