Mario J. Péerez Jiménez

Bio: Mario J. Péerez Jiménez is an academic researcher from University of Seville. The author has contributed to research in topics: Structural complexity theory & P. The author has an hindex of 1, co-authored 1 publications receiving 179 citations.

Complexity classes in models of cellular computing with membranes

Abstract: In this paper we introduce four complexity classes for cellular computing systems with membranes: the first and the second ones contain all decision problems solvable in polynomial time by a family of deterministic P systems, without and with an input membrane, respectively; the third and fourth classes contain all decision problems solvable in polynomial time by a family of non-deterministic P systems, without and with an input membrane, respectively. We illustrate the usefulness of these classes by solving two NP–complete problems, namely HPP and SAT, in both variants of P systems.

A polynomial complexity class in P systems using membrane division

Abstract: In this paper we introduce the complexity class PMCF of all decision problems solvable in polynomial time by a family of P systems belonging to a given class of membrane systems with input, F. We show that the problem of determining if a boolean formula in conjunctive normal form is satisfiable belongs to PMCAM, where AM is the class of recognizer P systems with input and with active membranes using 2-division. We conclude that the class NP is contained in the above mentioned complexity class.

Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes

Abstract: P systems are parallel molecular computing models based on processing multisets of objects in cell-like membrane structures. Recently, Petr Sosik has shown that a semi-uniform family of P systems with active membranes and 2-division is able to solve the PSPACE-complete problem QBF-SAT in linear time; he has also conjectured that the membrane dissolving rules of the (d) type may be omitted, but probably not the (f) type rules for non-elementary membrane division. In this paper, we partially confirm the conjecture proving that dissolving rules are not necessary. Moreover, the construction is now uniform. It still remains open whether or not non-elementary membrane division is needed.

Trading polarizations for labels in P systems with active membranes

Abstract: This paper addresses the problem of removing the polarization of membranes from P systems with active membranes - and this is achieved by allowing the change of membrane labels by means of communication rules or by membrane dividing rules. As consequences of these results, we obtain the universality of P systems with active membranes which are allowed to change the labels of membranes, but do not use polarizations. Universality results are easily obtained also by direct proofs. By direct constructions, we also prove that SAT can be solved in linear time by systems without polarizations and with label changing possibilities. If non-elementary membranes can be divided, then SAT can be solved in linear time without using polarizations and label changing. Several open problems are also formulated.

Simulation of P systems with active membranes on CUDA

Abstract: P systems or Membrane Systems provide a high-level computational modelling framework that combines the structure and dynamic aspects of biological systems in a relevant and understandable way. They are inherently parallel and non-deterministic computing devices. In this article, we discuss the motivation, design principles and key of the implementation of a simulator for the class of recognizer P systems with active membranes running on a (GPU). We compare our parallel simulator for GPUs to the simulator developed for a single central processing unit (CPU), showing that GPUs are better suited than CPUs to simulate P systems due to their highly parallel nature.