Computational Efficiency of P Systems with Symport/Antiport Rules and Membrane Separation
|Author||Valencia Cabrera, Luis
Macías Ramos, Luis Felipe
Riscos Núñez, Agustín
Pérez Jiménez, Mario de Jesús
|Department||Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial|
|Published in||Proceedings of the Thirteenth Brainstorming Week on Membrane Computing, 325-370. Sevilla, E.T.S. de Ingeniería Informática, 2-6 de Febrero, 2015,|
|Abstract||Membrane ssion is a process by which a biological membrane is split into
two new ones in such a way that the contents of the initial membrane is separated and distributed
between the new membranes. Inspired by this biological phenomenon, membrane...
Membrane ssion is a process by which a biological membrane is split into two new ones in such a way that the contents of the initial membrane is separated and distributed between the new membranes. Inspired by this biological phenomenon, membrane separation rules were considered in membrane computing. In this paper we deal with celllike P systems with membrane separation rules that use symport/antiport rules (such systems compute by changing the places of objects with respect to the membranes, and not by changing the objects themselves) as communication rules. Speci cally we study a lower bound on the length of communication rules with respect to the computational e ciency of such kind of membrane systems; that is, their ability to solve computationally hard problems in polynomial time by trading space for time. The main result of this paper is the following: communication rules involving at most three objects is enough to achieve the computational e ciency of P systems with membrane separation. Thus, a polynomial time solution to SAT problem is provided in this computing framework. It is known that only problems in P can be solved in polynomial time by using minimal cooperation in communication rules and membrane separation, so the lower bound of the e ciency obtained is an optimal bound.