TY - JOUR

T1 - On the power of membrane division in P systems

AU - Pǎun, Gheorghe

AU - Suzuki, Yasuhiro

AU - Tanaka, Hiroshi

AU - Yokomori, Takashi

N1 - Funding Information:
Research supported by “Research for Future” Program no. JSPS-RFTF 96I00101, from the Japan Society for the Promotion of Science, and by grant-in-aid for Exploratory Research, No. 11878055 and No. 11837005, from the Ministry of Education, Science, Sports, and Culture of Japan. ∗Corresponding author. E-mail addresses: gpaun@imar.ro, gpaun@hotmail.com (G. Pa)un), suzuki.com@mri.tmd.ac.jp (Y. Suzuki), tanaka@tmd.ac.jp (H. Tanaka), yokomori@mn.waseda.ac.jp (T. Yokomori).

PY - 2004/9/16

Y1 - 2004/9/16

N2 - First, we consider P systems with active membranes, hence with the possibility that the membranes can be divided, with non-cooperating evolution rules (the objects always evolve separately). These systems are known to be able to solve NP-complete problems in linear time. Here we give a normal form theorem for such systems: their computational universality is preserved even if only the elementary membranes are divided. The possibility of solving SAT in linear time is preserved only when non-elementary membranes may also be divided under the influence of objects in their region. Second, we consider a slight generalization, namely, we allow that a membrane can produce by division both a copy of itself and a copy of a membrane with a different label; again, only elementary membranes may be divided. In this case, we prove that the hierarchy on the maximal number of membranes present in the system collapses: three membranes at a time are sufficient in order to characterize the recursively enumerable sets of vectors of natural numbers. This result is optimal, two membranes are shown not to be sufficient. Third, we consider P systems with cooperating rules (several objects may evolve together). Making use of this powerful feature, we show that many NP-complete problems can be solved in linear time in a quite uniform way (by systems which are very similar to each other), using only elementary membranes division (and not further ingredients, such as electrical charges). The degree of cooperation is minimal: two objects at a time.

AB - First, we consider P systems with active membranes, hence with the possibility that the membranes can be divided, with non-cooperating evolution rules (the objects always evolve separately). These systems are known to be able to solve NP-complete problems in linear time. Here we give a normal form theorem for such systems: their computational universality is preserved even if only the elementary membranes are divided. The possibility of solving SAT in linear time is preserved only when non-elementary membranes may also be divided under the influence of objects in their region. Second, we consider a slight generalization, namely, we allow that a membrane can produce by division both a copy of itself and a copy of a membrane with a different label; again, only elementary membranes may be divided. In this case, we prove that the hierarchy on the maximal number of membranes present in the system collapses: three membranes at a time are sufficient in order to characterize the recursively enumerable sets of vectors of natural numbers. This result is optimal, two membranes are shown not to be sufficient. Third, we consider P systems with cooperating rules (several objects may evolve together). Making use of this powerful feature, we show that many NP-complete problems can be solved in linear time in a quite uniform way (by systems which are very similar to each other), using only elementary membranes division (and not further ingredients, such as electrical charges). The degree of cooperation is minimal: two objects at a time.

KW - Membrane computing

KW - Recursively enumerable language

KW - SAT problem

KW - Universality

UR - http://www.scopus.com/inward/record.url?scp=4344596902&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4344596902&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2004.03.053

DO - 10.1016/j.tcs.2004.03.053

M3 - Conference article

AN - SCOPUS:4344596902

SN - 0304-3975

VL - 324

SP - 61

EP - 85

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

T2 - Words, Languages and Combinatorics

Y2 - 14 March 2000 through 18 March 2000

ER -