Polarizationless P Systems with Active Membranes: Computational Complexity Aspects

P systems with active membranes, in their classical definition, make use of non-cooperative rules only. However, it is well known that in living cells, proteins interact %between themselves among them yielding new products. Inspired by this biological phenomenon, the previous framework is reformulated in this paper, allowing cooperation in object evolution rules, while removing electrical charges associated with membranes. More precisely, minimal cooperation in object evolution rules is incorporated in polarizationless P systems with active membranes. In this paper, the term ``minimal'' means that the left-hand side of such rules consists of at most two symbols, and its length is greater than or equal to the corresponding right-hand side. The computational efficiency of this kind of P systems is studied by providing a uniform polynomial-time solution to {\tt SAT} problem in such manner that only division rules for elementary membranes are used and dissolution rules are forbidden. Bearing in mind that only tractable problems can be efficiently solved by families of polarizationless P systems with active membranes and without dissolution rules, passing from non-cooperation to minimal cooperation in object evolution rules amounts passing from non-efficiency to efficiency in this framework. This frontier of efficiency provides, as any other borderline does, a possible way to address the {\bf P} versus {\bf NP} problem.

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

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

[3]  Artiom Alhazov,et al.  Uniform Solution of , 2007, MCU.

[4]  Artiom Alhazov,et al.  Trading polarizations for labels in P systems with active membranes , 2004, Acta Informatica.

[5]  Mario J. Pérez-Jiménez,et al.  A Polynomial Complexity Class in P Systems Using Membrane Division , 2003, DCFS.

[6]  Mario J. Pérez-Jiménez,et al.  An Approach to Computational Complexity in Membrane Computing , 2004, Workshop on Membrane Computing.

[7]  Artiom Alhazov,et al.  Polarizationless P Systems with Active Membranes , 2004, Grammars.

[8]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[9]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[10]  Gheorghe Paun,et al.  Computing with Membranes: Attacking NP-Complete Problems , 2000, UMC.

[11]  Gheorghe Paun Further Twenty Six Open Problems in Membrane Computing , 2005 .

[12]  Mario J. Pérez-Jiménez,et al.  Characterizing Tractability by Cell-Like Membrane Systems , 2007, Formal Models, Languages and Applications.

[13]  Alfonso Rodríguez-Patón,et al.  P Systems with Active Membranes Characterize PSPACE , 2006, DNA.

[14]  M. J. P. Jiménez,et al.  On the power of dissolution in p systems with active membranes , 2005 .

[15]  Mario J. Pérez-Jiménez,et al.  On the Power of Dissolution in P Systems with Active Membranes , 2005, Workshop on Membrane Computing.