Tissue-like P Systems Without Environment

In this paper we present a tissue-like P systems model with cell division the environment has been replaced by an extra cell. In such model, we present a uniform family of recognizer P systems which solves the Subset Sum problem. This solution establishes a new frontier for the tractability of computationally hard problems in Membrane Computing, since it proves that NP-complete problems can be solved without an arbitrarily large amount of objects in the environment.

[1]  Alfonso Rodríguez-Patón,et al.  A New Class of Symbolic Abstract Neural Nets: Tissue P Systems , 2002, COCOON.

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

[3]  Raghavan Rama,et al.  Tissue P Systems with Contextual and Rewriting Rules , 2002, WMC-CdeA.

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

[5]  Alfonso Rodríguez-Patón,et al.  Tissue P systems , 2003, Theor. Comput. Sci..

[6]  Marian Gheorghe,et al.  Cell Communication in Tissue P Systems and Cell Division in Population P Systems , 2004 .

[7]  Gheorghe Paun,et al.  Second Brainstorming Week on Membrane Computing , 2004, J. Univers. Comput. Sci..

[8]  Rudolf Freund,et al.  Tissue P systems with channel states , 2005, Theor. Comput. Sci..

[9]  Artiom Alhazov,et al.  Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells , 2005, Developments in Language Theory.

[10]  Agustín Riscos-Núñez,et al.  Computational efficiency of dissolution rules in membrane systems , 2006, Int. J. Comput. Math..

[11]  Mario J. Pérez-Jiménez,et al.  Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division , 2007, IWINAC.

[12]  Mario J. Pérez-Jiménez,et al.  A uniform family of tissue P systems with cell division solving 3-COL in a linear time , 2008, Theor. Comput. Sci..

[13]  Mario J. Pérez-Jiménez,et al.  Characterizing Tractability by Tissue-Like P Systems , 2009, Workshop on Membrane Computing.