Characterizing Tractability by Tissue-Like P Systems

In the framework of cell–like membrane systems it is well known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP–complete problems. Nonetheless, it may be sufficient to create an exponential number of membranes in polynomial time. In the framework of recognizer polarizationless P systems with active membranes, the construction of an exponential workspace expressed in terms of number of membranes and objects may not suffice to efficiently solve computationally hard problems. In this paper we study the computational efficiency of recognizer tissue P systems with communication (symport/antiport) rules and division rules. Some results have been already obtained in this direction: (a) using communication rules and forbidding division rules, only tractable problems can be efficiently solved; (b) using communication rules with length three and division rules, NP–complete problems can be efficiently solved. In this paper we show that the length of communication rules plays a relevant role from the efficiency point of view for this kind of P systems.

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

[2]  Hendrik Jan Hoogeboom,et al.  Simulating Counter Automata by P Systems with Symport/Antiport , 2002, WMC-CdeA.

[3]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[4]  Mario J. Pérez-Jiménez,et al.  Efficient simulation of tissue-like P systems by transition cell-like P systems , 2008, Natural Computing.

[5]  Mario de Jesús Pérez Jiménez,et al.  Computational Efficiency of Cellular Division in Tissue-like Membrane Systems , 2008 .

[6]  Gheorghe Păun,et al.  Tissue P Systems with Cell Division , 2008, Int. J. Comput. Commun. Control.

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

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

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

[10]  Gheorghe Paun,et al.  Recent Computability Models Inspired from Biology: DNA and Membrane Computing , 2003 .

[11]  Mario de Jesús Pérez Jiménez,et al.  Complexity Classes in Cellular Computing with Membranes , 2003 .

[12]  Andrei Paun,et al.  The power of communication: P systems with symport/antiport , 2002, New Generation Computing.

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