Machine models and simulations
Handbook of theoretical computer science (vol. A)
Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
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
Membrane computing and complexity theory: A characterization of PSPACE
Journal of Computer and System Sciences
P Systems with Proteins on Membranes
Fundamenta Informaticae
Computing with Cells: Advances in Membrane Computing
Computing with Cells: Advances in Membrane Computing
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
P systems with proteins on membranes and membrane division
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
A computational complexity theory in membrane computing
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Selected topics in computational complexity of membrane systems
Computation, cooperation, and life
| Hi-index | 0.00 |
P systems with proteins on membranes are inspired closely by switching protein channels. This model of membrane computing using membrane division has been previously shown to solve an NP-complete problem in polynomial time. In this paper we characterize the class of problems solvable by these P systems in polynomial time and we show that it equals PSPACE. Therefore, these P systems are computationally equivalent (up to a polynomial time reduction) to the alternating Turing machine or the PRAM computer. The proof technique we employ reveals also some interesting trade-offs between certain P system properties, as antiport rules, membrane labeling by polarization or the presence of proteins.