scholarly journals Bio-inspired Membrane Operations in P Systems with Active Membranes

Triangle ◽  
2018 ◽  
pp. 19
Author(s):  
Artiom Alhazov ◽  
Tseren-Onolt Ishdorj
Keyword(s):  
General Class ◽  
Membrane Structure ◽  
Membrane Separation ◽  
Linear Time ◽  
P Systems ◽  
Sat Problem ◽  
Separation Membrane ◽  
Active Membranes

In this paper we define a general class of P systems covering some biological operations with membranes, including evolution, communication, and modifying the membrane structure, and we describe and formally specify some of these operations: membrane merging, membrane separation, membrane release. We also investigate a particular combination of types of rules that can be used in solving the SAT problem in linear time.

scholarly journals A new method to simulate restricted variants of polarizationless P systems with active membranes

2019 ◽  
Vol 1 (4) ◽  
pp. 251-261 ◽  
Author(s):  
Zsolt Gazdag ◽  
Gábor Kolonits
Keyword(s):  
Membrane Structure ◽  
P Systems ◽  
New Approach ◽  
Complete Problems ◽  
Active Membranes ◽  
Special Cases ◽  
Division Polynomials ◽  
Initial Membrane ◽  
Membrane Division ◽  
Elementary Membrane

AbstractAccording to the P conjecture by Gh. Păun, polarizationless P systems with active membranes cannot solve $${\mathbf {NP}}$$NP-complete problems in polynomial time. The conjecture is proved only in special cases yet. In this paper we consider the case where only elementary membrane division and dissolution rules are used and the initial membrane structure consists of one elementary membrane besides the skin membrane. We give a new approach based on the concept of object division polynomials introduced in this paper to simulate certain computations of these P systems. Moreover, we show how to compute efficiently the result of these computations using these polynomials.

scholarly journals Time-free solution to SAT problem using P systems with active membranes

2014 ◽  
Vol 529 ◽  
pp. 61-68 ◽  
Author(s):  
Tao Song ◽  
Luis F. Macías-Ramos ◽  
Linqiang Pan ◽  
Mario J. Pérez-Jiménez
Keyword(s):  
P Systems ◽  
Free Solution ◽  
Sat Problem ◽  
Active Membranes

Semi-Uniform Solution for Common Algorithmic Problem by P System in the Minimally Parallel Mode

2014 ◽  
Vol 568-570 ◽  
pp. 802-806
Author(s):  
Yun Yun Niu ◽  
Zhi Gao Wang
Keyword(s):  
Linear Time ◽  
P Systems ◽  
P System ◽  
Algorithmic Problem ◽  
Complete Problems ◽  
Active Membranes ◽  
Uniform Solution ◽  
Parallel Mode ◽  
The Common ◽  
Np Complete

It is known that the Common Algorithmic Problem (CAP) has a nice property that several other NP-complete problems can be reduced to it in linear time. In the literature, the decision version of this problem can be efficiently solved with a family of recognizer P systems with active membranes with three electrical charges working in the maximally parallel way. We here work with a variant of P systems with active membranes that do not use polarizations and present a semi-uniform solution to CAP in the minimally parallel mode.

scholarly journals Tissue P Systems with Cell Division

2008 ◽  
Vol 3 (3) ◽  
pp. 295 ◽  
Author(s):  
Gheorghe Păun ◽  
Mario J. Perez-Jimenez ◽  
Agustín Riscos-Nunez
Keyword(s):  
Cell Division ◽  
Polynomial Time ◽  
Basic Feature ◽  
P Systems ◽  
Sat Problem ◽  
Active Membranes ◽  
Hard Problems

In tissue P systems several cells (elementary membranes) communicate through symport/antiport rules, thus carrying out a computation. We add to such systems the basic feature of (cell–like) P systems with active membranes – the possibility to divide cells. As expected (as it is the case for P systems with active membranes), in this way we get the possibility to solve computationally hard problems in polynomial time; we illustrate this possibility with SAT problem.

A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time

2016 ◽  
Vol 17 (2) ◽  
pp. 311-319 ◽  
Author(s):  
A. Hepzibah Christinal ◽  
Daniel Díaz-Pernil ◽  
T. Mathu
Keyword(s):  
Linear Time ◽  
P Systems

A Linear-Time Solution for All-SAT Problem Based on P System

2018 ◽  
Vol 27 (2) ◽  
pp. 367-373 ◽  
Author(s):  
Ping GUO ◽  
Jian ZHU ◽  
Haizhu CHEN ◽  
Ruilong YANG
Keyword(s):  
Linear Time ◽  
P System ◽  
Sat Problem ◽  
Time Solution
Sign in / Sign up

Export Citation Format

Share Document