Tissue P Systems with Cell Separation: Upper Bound by PSPACE

2012 ◽  
pp. 201-215 ◽  
Author(s):  
Petr Sosík ◽  
Luděk Cienciala
Keyword(s):  
Upper Bound ◽  
Cell Separation ◽  
P Systems

The Efficiency of Tissue P Systems with Cell Separation Relies on the Environment

2013 ◽  
pp. 243-256 ◽  
Author(s):  
Luis F. Macías-Ramos ◽  
Mario J. Pérez-Jiménez ◽  
Agustín Riscos-Núñez ◽  
Miquel Rius-Font ◽  
Luis Valencia-Cabrera
Keyword(s):  
Cell Separation ◽  
P Systems

scholarly journals The Computational Complexity of Tissue P Systems with Evolutional Symport/Antiport Rules

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-21 ◽  
Author(s):  
Linqiang Pan ◽  
Bosheng Song ◽  
Luis Valencia-Cabrera ◽  
Mario J. Pérez-Jiménez
Keyword(s):  
Computational Complexity ◽  
Natural Number ◽  
Polynomial Time ◽  
Cell Separation ◽  
Computational Models ◽  
P Systems ◽  
Fission Process ◽  
Work Cell ◽  
Membrane Fission ◽  
Biochemical Systems

Tissue P systems with evolutional communication (symport/antiport) rules are computational models inspired by biochemical systems consisting of multiple individuals living and cooperating in a certain environment, where objects can be modified when moving from one region to another region. In this work, cell separation, inspired from membrane fission process, is introduced in the framework of tissue P systems with evolutional communication rules. The computational complexity of this kind of P systems is investigated. It is proved that only problems in class P can be efficiently solved by tissue P systems with cell separation with evolutional communication rules of length at most (n,1), for each natural number n≥1. In the case where that length is upper bounded by (3,2), a polynomial time solution to the SAT problem is provided, hence, assuming that P≠NP a new boundary between tractability and NP-hardness on the basis of the length of evolutional communication rules is provided. Finally, a new simulator for tissue P systems with evolutional communication rules is designed and is used to check the correctness of the solution to the SAT problem.

scholarly journals FURTHER RESULTS ON P SYSTEMS WITH PROMOTERS/INHIBITORS

2006 ◽  
Vol 17 (01) ◽  
pp. 205-221 ◽  
Author(s):  
DRAGOŞ SBURLAN
Keyword(s):  
Upper Bound ◽  
P Systems ◽  
Not Given ◽  
The Family

This paper presents several results regarding P systems with non-cooperative rules and promoters/inhibitors at the level of rules. For the class of P systems using inhibitors, generating families of sets of vectors of numbers, a characterization of the family of Parikh sets of ET0L languages is shown. In the case of P systems with non-cooperative promoted rules even if an upper bound was not given, the inclusion of the family PsET0L was proved. Moreover, a characterization of such systems by means of a particular form of random context grammars, therefore a sequential formal device, is proposed.

An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation

2015 ◽  
Vol 138 (1-2) ◽  
pp. 45-60 ◽  
Author(s):  
Mario J. Pérez-Jiménez ◽  
Petr Sosík
Keyword(s):  
Cell Separation ◽  
P Systems

scholarly journals Solving Vertex Cover Problem by Means of Tissue P Systems with Cell Separation

2010 ◽  
Vol 5 (4) ◽  
pp. 540 ◽  
Author(s):  
Chun Lu ◽  
Xingyi Zhang
Keyword(s):  
Cell Separation ◽  
Membrane Computing ◽  
Linear Time ◽  
Vertex Cover ◽  
P Systems ◽  
Computing Model ◽  
Vertex Cover Problem ◽  
Complete Problems ◽  
Np Complete ◽  
Cover Problem

Tissue P systems is a computing model in the framework of membrane computing inspired from intercellular communication and cooperation between neurons. Many different variants of this model have been proposed. One of the most important models is known as tissue P systems with cell separation. This model has the ability of generating an exponential amount of workspace in linear time, thus it allows us to design cellular solutions to NP-complete problems in polynomial time. In this paper, we present a solution to the Vertex Cover problem via a family of such devices. This is the first solution to this problem in the framework of tissue P systems with cell separation.

A Uniform Solution to Subset Sum by Tissue P Systems with Cell Separation

2010 ◽  
Vol 7 (8) ◽  
pp. 1507-1513
Author(s):  
Yun Jiang ◽  
Xingyi Zhang ◽  
Zheng Zhang
Keyword(s):  
Cell Separation ◽  
P Systems ◽  
Subset Sum ◽  
Uniform Solution

Tissue P systems with cell separation: attacking the partition problem

2011 ◽  
Vol 54 (2) ◽  
pp. 293-304 ◽  
Author(s):  
XingYi Zhang ◽  
Shuo Wang ◽  
YunYun Niu ◽  
LinQiang Pan
Keyword(s):  
Cell Separation ◽  
P Systems ◽  
Partition Problem

Computational power of cell separation in tissue P systems

2014 ◽  
Vol 279 ◽  
pp. 805-815 ◽  
Author(s):  
Petr Sosík ◽  
Luděk Cienciala
Keyword(s):  
Cell Separation ◽  
P Systems ◽  
Computational Power
Sign in / Sign up

Export Citation Format

Share Document