P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Computation: finite and infinite machines
Computation: finite and infinite machines
P systems without multiplicities of symbol-objects
Information Processing Letters
P systems with minimal parallelism
Theoretical Computer Science
A formal framework for static (tissue) P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Computational completeness of p systems with active membranes and two polarizations
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
A new approach for solving SAT by p systems with active membranes
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Hi-index | 0.00 |
We investigate the computing power and the efficiency of P systems with active membranes without polarizations, working in the minimally parallel mode. Such systems are shown to be computationally complete even when using only rules handling single objects in the membranes and avoiding the division of non-elementary membranes. Moreover, we elaborate an algorithm for solving NP-complete problems, yet in this case we need evolution rules generating at least two objects as well as rules for non-elementary membrane division.