Search
Now showing items 1-10 of 15
Article
A uniform family of tissue P systems with cell division solving 3-COL in a linear time
(Elsevier, 2008)
Several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found in the literature(obviously, trading space for time). Recently, different new models ...
Article
Tissue P systems with channel states
(Elsevier, 2005)
We consider tissue-like P systems with states associated with the links (we call them synapses) between cells, controlling the passage of objects across the links. We investigate the computing power of such devices for ...
Article
Solving the Subset-Sum Problem by P Systems with Active Membranes
(Springer, 2005)
We present the first membrance computing solution to the Subset-Sum problem using a family of deterministic P systems with active membranes. We do not use priority among rules, membrane dissolution nor cooperation; it ...
Article
On the degree of parallelism in membrane systems
(Elsevier, 2007)
In the literature, several designs of P systems might be found for performing the same task. The use of different techniques or even different P system models makes it very difficult to compare these designs. In this ...
Article
P systems with minimal parallelism
(Elsevier, 2007)
A current research topic in membrane computing is to find more realistic P systems from a biological point of view, and one target in this respect is to relax the condition of using the rules in a maximally parallel way. ...
Article
Complexity aspects of polarizationless membrane systems
(Springer, 2009)
We investigate polarizationless P systems with active membranes working in maximally parallel manner, which do not make use of evolution or communication rules, in order to find which features are sufficient to efficiently ...
Article
A linear-time tissue P system based solution for the 3-coloring problem
(Elsevier, 2007)
In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found (obviously, trading space for time). Recently, different new ...
Article
A Prolog Simulator for Deterministic P Systems with Active Membranes
(Springer, 2004)
In this paper we propose a new way to represent P systems with active membranes based on Logic Programming techniques. This representation allows us to express the set of rules and the configuration of the P system in ...
Article
A uniform solution to SAT using membrane creation
(Elsevier, 2007)
In living cells, new membranes are produced basically through two processes: mitosis and autopoiesis. These two processes have inspired two variants of cell-like membrane systems, namely P systems with active membranes ...
Article
A software tool for verification of Spiking Neural P Systems
(Springer, 2008)
The formal verification of a Spiking Neural P System (SN P Systems, for short) designed for solving a given problem is usually a hard task. Basically, the verification process consists of the search of invariant formulae ...