Cell-like P systems with evolutional symport/antiport rules and membrane creation

Abstract Cell-like P systems with symport/antiport rules are computing models inspired by the conservation law, in the sense that they compute by changing the places of objects with respect to the membranes, and not by changing the objects themselves. In this work, a variant of these kinds of membrane systems, called cell-like P systems with evolutional symport/antiport rules, where objects can evolve in the execution of such rules, is introduced. Besides, inspired by the autopoiesis process (ability of a system to maintain itself), membrane creation rules are considered as an efficient mechanism to provide an exponential workspace in terms of membranes. The presumed efficiency of these computing models (ability to solve computationally hard problems in polynomial time and uniform way) is explored. Specifically, an efficient solution to the SAT problem is provided by means of a family of recognizer cell-like P systems with evolutional symport/antiport rules and membrane creation which make use of communication rules involving a restricted number of objects.

[1]  Gheorghe Paun,et al.  Symport/Antiport P Systems with Three Objects Are Universal , 2004, Fundam. Informaticae.

[2]  Linqiang Pan,et al.  The Computational Complexity of Tissue P Systems with Evolutional Symport/Antiport Rules , 2018, Complex..

[3]  Xiangxiang Zeng,et al.  Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources , 2010, Theor. Comput. Sci..

[4]  Bosheng Song,et al.  Solution to PSPACE-Complete Problem Using P Systems with Active Membranes with Time-Freeness , 2019 .

[5]  Linqiang Pan,et al.  Tissue P Systems With Channel States Working in the Flat Maximally Parallel Way , 2016, IEEE Transactions on NanoBioscience.

[6]  Matteo Cavaliere.  Evolution-Communication P Systems , 2002, WMC-CdeA.

[7]  Linqiang Pan,et al.  A time-free uniform solution to subset sum problem by tissue P systems with cell division , 2015, Mathematical Structures in Computer Science.

[8]  Xiangxiang Zeng,et al.  Time-Free Spiking Neural P Systems , 2011, Neural Computation.

[9]  Mario J. Pérez-Jiménez,et al.  Membrane fission versus cell division: When membrane proliferation is not enough , 2015, Theor. Comput. Sci..

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

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

[12]  Hendrik Jan Hoogeboom,et al.  P systems with symport/antiport simulating counter automata , 2004, Acta Informatica.

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

[14]  Linqiang Pan,et al.  Flat maximal parallelism in P systems with promoters , 2016, Theor. Comput. Sci..

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

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

[17]  Kamala Krithivasan,et al.  P Systems with Membrane Creation: Universality and Efficiency , 2001, MCU.

[18]  Artiom Alhazov,et al.  Towards a Characterization of P Systems with Minimal Symport/Antiport and Two Membranes , 2006, Workshop on Membrane Computing.

[19]  Mario J. Pérez-Jiménez,et al.  A Linear Solution of Subset Sum Problem by Using Membrane Creation , 2005, IWINAC.

[20]  Petr Sosík,et al.  An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation , 2015, Fundam. Informaticae.

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

[22]  Linqiang Pan,et al.  Tissue-like P systems with evolutional symport/antiport rules , 2017, Inf. Sci..

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

[24]  Erzsébet Csuhaj-Varjú,et al.  On small universal antiport P systems , 2007, Theor. Comput. Sci..

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

[26]  Mario J. Pérez-Jiménez,et al.  A uniform solution to SAT using membrane creation , 2007, Theor. Comput. Sci..

[27]  Bosheng Song,et al.  Membrane fission: A computational complexity perspective , 2016, Complex..

[28]  Mario J. Pérez-Jiménez,et al.  Characterizing tractability with membrane creation , 2005, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05).

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

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[32]  Mario J. Pérez-Jiménez,et al.  An efficient time-free solution to QSAT problem using P systems with proteins on membranes , 2017, Inf. Comput..

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

[34]  Artiom Alhazov,et al.  P Systems with One Membrane and Symport/Antiport Rules of Five Symbols Are Computationally Complete , 2005 .

[35]  Oscar H. Ibarra,et al.  On spiking neural P systems , 2006, Natural Computing.

[36]  Vincenzo Manca,et al.  P Systems with Boundary Rules , 2002, WMC-CdeA.

[37]  Andrei Paun,et al.  Computing by Communication in Networks of Membranes , 2002, Int. J. Found. Comput. Sci..

[38]  Gabriel Ciobanu,et al.  P systems with minimal parallelism , 2007, Theor. Comput. Sci..

[39]  Andrei Paun,et al.  P systems with proteins on membranes characterize PSPACE , 2013, Theor. Comput. Sci..

[40]  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..

[41]  Linqiang Pan,et al.  Time-free solution to SAT problem using P systems with active membranes , 2014, Theor. Comput. Sci..

[42]  Artiom Alhazov,et al.  Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes , 2003, Fundam. Informaticae.

[43]  Petr Sosík.  P systems attacking hard problems beyond NP: a survey , 2019, J. Membr. Comput..