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
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Complexity classes in models of cellular computing with membranes
Natural Computing: an international journal
Further remarks on P systems with active membranes, separation, merging, and release rules
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Computation: finite and infinite machines
Computation: finite and infinite machines
Computing with cells: membrane systems-some complexity issues
International Journal of Parallel, Emergent and Distributed Systems
A Framework for Complexity Classes in Membrane Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
On efficient algorithms for SAT
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 0.00 |
Minimal parallelism was recently introduced [3] as a way the rules of a P system are used: from each set of applicable rules associated to the same membrane, at least one must be applied. In this paper, we consider the minimal parallelism for P systems with active membranes without polarizations, using additional features, such as separation operations, changing membrane labels, catalytic or cooperative rules, etc. With several combinations of such features we obtain computational completeness. In cases where membrane division (of elementary or non-elementary membranes) is allowed, we show how SAT can be solved in polynomial time.