Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Solving NP-Complete Problems Using P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
The computational power of cell division in P systems: Beating down parallel computers?
Natural Computing: an international journal
Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes
Fundamenta Informaticae
On the computational complexity of membrane systems
Theoretical Computer Science
UC'05 Proceedings of the 4th international conference on Unconventional Computation
On the power of dissolution in p systems with active membranes
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the efficiency of p systems with active membranes and two polarizations
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Selected topics in computational complexity of membrane systems
Computation, cooperation, and life
P systems simulating oracle computations
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Space complexity equivalence of P systems with active membranes and Turing machines
Theoretical Computer Science
| Hi-index | 0.00 |
We show that a deterministic single-tape Turing machine, operating in polynomial space with respect to the input length, can be efficiently simulated (both in terms of time and space) by a semi-uniform family of P systems with active membranes and three polarizations, using only communication rules. Then, basing upon this simulation, we prove that a result similar to the space hierarchy theorem can be obtained for P systems with active membranes: the larger the amount of space we can use during the computations, the harder the problems we are able to solve.