Flat maximal parallelism in tissue P systems with promoters

Tissue P systems with promoters are distributed parallel computing models inspired by the structure of tissues and the way of communicating substances regulated by promoters. In this work, we consider tissue P systems with promoters working in a flat maximally parallel way, where in each step, in each membrane, a maximal set of applicable rules is chosen and each rule in the set is applied exactly once. It is proved that tissue P systems with at most two promoters associated with any rule and using only symport rules of length 1 are Turing universal. Moreover, a uniform solution to the SAT problem is provided by tissue P systems with at most two promoters associated with any rule and using cell division rules and symport rules of length 1. Key-words: Tissue P system, Promoter, Flat maximal parallelism, SAT problem, Universality

[1]  Linqiang Pan,et al.  The computational power of tissue-like P systems with promoters , 2016, Theor. Comput. Sci..

[2]  Marian Gheorghe,et al.  Evolutionary membrane computing: A comprehensive survey and new results , 2014, Inf. Sci..

[3]  Linqiang Pan,et al.  Time-free solution to SAT problem by P systems with active membranes and standard cell division rules , 2014, Natural Computing.

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

[5]  Mario J. Pérez-Jiménez,et al.  Computational complexity of tissue-like P systems , 2010, J. Complex..

[6]  Mario J. Pérez-Jiménez,et al.  An efficient time-free solution to SAT problem by P systems with proteins on membranes , 2016, J. Comput. Syst. Sci..

[7]  Linqiang Pan,et al.  Computational Efficiency and Universality of Timed P Systems with Membrane Creation , 2014, BIC-TA.

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

[9]  Linqiang Pan,et al.  Computational efficiency and universality of timed P systems with active membranes , 2015, Theor. Comput. Sci..

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

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

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

[13]  Petr Sosík,et al.  Small (purely) catalytic P systems simulating register machines , 2016, Theor. Comput. Sci..

[14]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[15]  Giancarlo Mauri,et al.  Membrane Division, Oracles, and the Counting Hierarchy , 2015, Fundam. Informaticae.

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

[17]  Ferrante Neri,et al.  An Optimization Spiking Neural P System for Approximately Solving Combinatorial Optimization Problems , 2014, Int. J. Neural Syst..

[18]  Hong Peng,et al.  An unsupervised learning algorithm for membrane computing , 2015, Inf. Sci..

[19]  Artiom Alhazov,et al.  (Tissue) P Systems with Unit Rules and Energy Assigned to Membranes , 2006, Fundam. Informaticae.

[20]  Miguel Ángel Gutiérrez Naranjo,et al.  Cell Complexes and Membrane Computing for Thinning 2D and 3D Images , 2012 .

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

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

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

[24]  Mario J Pérez-Jiménez,et al.  Efficient solutions to hard computational problems by P systems with symport/antiport rules and membrane division , 2015, Biosyst..

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

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

[27]  Miguel Ángel Gutiérrez Naranjo,et al.  Counting Cells with Tissue-like P Systems , 2012 .

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

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

[30]  Hong Peng,et al.  Fuzzy reasoning spiking neural P system for fault diagnosis , 2013, Inf. Sci..

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

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

[33]  Rudolf Freund,et al.  (Tissue) P systems working in the k-restricted minimally or maximally parallel transition mode , 2010, Natural Computing.

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

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

[36]  Shuo Wang,et al.  Tissue P systems with cell separation: attacking the partition problem , 2010, Science China Information Sciences.