Recent complexity-theoretic results on P systems with active membranes

Membrane systems, also called P systems, are an interesting class of parallel and distributed models of computation inspired by cell biology. They have been thoroughly investigated in the literature, both from the theoretical standpoint—analysing their computing power and efficiency— and as tools to model natural phenomena. In this paper we focus on the complexity theory of P systems with active membranes, a variant of P systems where the membranes themselves affect the applicability of rules and change (both in number and structurally) during computations. We summarise the main results on their space complexity, and describe some recent improvements related to time complexity, proved via a few general proof techniques.

[1]  Giancarlo Mauri,et al.  Introducing a Space Complexity Measure for P Systems , 2009, Int. J. Comput. Commun. Control.

[2]  Giancarlo Mauri,et al.  Complexity classes for membrane systems , 2006, RAIRO Theor. Informatics Appl..

[3]  Giancarlo Mauri,et al.  P systems with active membranes: trading time for space , 2010, Natural Computing.

[4]  Mario J. Pérez-Jiménez,et al.  Complexity classes in models of cellular computing with membranes , 2003, Natural Computing.

[5]  Giancarlo Mauri,et al.  Solving NP-Complete Problems Using P Systems with Active Membranes , 2000, UMC.

[6]  Alberto Leporati,et al.  On a Powerful Class of Non-universal P Systems with Active Membranes , 2010, Developments in Language Theory.

[7]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[8]  Giancarlo Mauri,et al.  Non-confluence in divisionless P systems with active membranes , 2010, Theor. Comput. Sci..

[9]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[10]  Giancarlo Mauri,et al.  P Systems with Active Membranes Working in Polynomial Space , 2011, Int. J. Found. Comput. Sci..

[11]  Phokion G. Kolaitis,et al.  Phase transitions of PP-complete satisfiability problems , 2001, Discret. Appl. Math..

[12]  Miguel Ángel Gutiérrez Naranjo,et al.  Fifth Brainstorming Week on Membrane Computing , 2007 .

[13]  Niall Murphy,et al.  The computational power of membrane systems under tight uniformity conditions , 2010, Natural Computing.

[14]  D. R. Lick,et al.  The Theory and Applications of Graphs. , 1983 .

[15]  Giancarlo Mauri,et al.  P Systems with Elementary Active Membranes: Beyond NP and coNP , 2010, Int. Conf. on Membrane Computing.

[16]  Giancarlo Mauri,et al.  Elementary Active Membranes Have the Power of Counting , 2011, Int. J. Nat. Comput. Res..

[17]  Gheorghe Paun.  P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..

[18]  Alfonso Rodríguez-Patón,et al.  Membrane computing and complexity theory: A characterization of PSPACE , 2007, J. Comput. Syst. Sci..

[19]  Arnold L. Rosenberg,et al.  Counter machines and counter languages , 1968, Mathematical systems theory.