ORELLANA MARTÍN , David

P systems with active membranes is a widely studied framework within the field of Membrane Computing since the creation of the discipline. The abstraction of the structure and behavior of living cells is reflected in the tree-like hierarchy and the kinds of rules that can be used in these kinds of systems. Resembling the organization and...

No description

We model the problem of contour approximation using Hilbert's space lling curve, with a novel type of parallel array rewriting rules. We further use their pattern to introduce a special type of tissue P system, with novel features, among which is controlling their behavior with input. We propose some further developments.

Many variants of P systems have the ability to generate an exponential number of membranes in linear time. This feature has been exploited to elaborate (theoretical) efficient solutions to NP-complete, or even harder, problems. A thorough review of the existent solutions shows the utilization of common techniques and procedures. The...

In 2005, Gh. Păun raised an interesting question concerning the role of electrical charges in P systems with active membranes from a complexity point of view. Specifically, he formulated a question about the computational efficiency of polarization-less P systems with dissolution rules and division rules only for elementary membranes....

P systems with active membranes are a class of computation models in the area ofmembrane computing, which are inspired from the mechanism by which chemicalsinteract and cross cell membranes. In this work, we consider a normal form of P systemswith active membranes, called cell-like P systems with polarizations and minimal rules,where rules are...

From the creation of the field of Membrane Computing in 1998, several research lines havebeen opened. On the one hand, theoretical questions like the computational power and thecomputational efficiency of P systems have been studied. In this sense, several techniquesto demonstrate the ability of these systems to provide solutions to...

A widely studied field in the framework of membrane computing is computational complexity theory. While some types of P systems are only capable of efficiently solving problems from the class P, adding one or more syntactic or semantic ingredients to these membrane systems can give them the ability to efficiently solve presumably intractable...

In Membrane Computing, diferent variants of devices can be found by changing both syntactical and semantic ingredients. These devices are usually called membrane systems or P systems, and they recall the structure and behavior of living cells in the nature. In this sense, rules are introduced as a way for objects to interact with membranes,...

In the framework of membrane computing, several frontiers of e ciency have been found with respect to the resources that di erent families of P systems take to solve a decision problem. Each of these frontiers provides a new way to tackle the P versus NP problem. In this sense, optimal frontiers are needed in order to separate close variants...

The factorization problem (given a natural number which is the product of two prime numbers, find its decomposition) is conjectured to be intractable and for that it has been used as the key to have secure current cryptosystems. Due to its relevance, this problem has been studied in various computational paradigms, in particular in...

P systems are computing devices based on sets of rules that dictate how they work. While some of these rules can change the objects within the system, other rules can even change the own structure, like creation rules. They have been used in cell-like membrane systems with active membranes to efficiently solve NP-complete problems. In this...

Spiking Neural P Systems (SNP) are well-established computing models that take inspiration from spikes between biological neurons; these models have been widely used for both theoretical studies and practical applications. Virus machines (VMs) are an emerging computing paradigm inspired by viral transmission and replication. In this work, a...

The tape of a deterministic Turing machine contains an unbounded number of cells. Thanks to that, a single machine can solve decision problems with an infinite number of instances. Nevertheless, in the framework of membrane computing, traditionally a \solution" to an abstract decision problem consists of a family of membrane systems (where each...

Cooperation is doubtless a relevant ingredient on rewriting rules based computing models. This paper provides an overview on both classical and newest results studying how cooperation among objects influences the ability of cell-like membrane systems to solve computationally hard problems in an efficient way. In this paper, two types of such...

In the framework of Membrane Computing, several efficient solutions to computationally hard problems have been given. To find new borderlines between families of P systems that can solve them and the ones that cannot is an important way to tackle the P versus NP problem. Adding syntactic and/or semantic ingredients can mean passing from...

In the field of Membrane Computing, computational complexity theory has been widely studied trying to nd frontiers of efficiency by means of syntactic or semantical ingredients. The objective of this is to nd two kinds of systems, one non-efficient and another one, at least, presumably efficient, that is, that can solve NP-complete...