P systems with active membranes operating under minimal parallelism

Authors:
Pierluigi Frisco;Gordon Govan
Affiliations:
School of Math. and Comp. Sciences, Heriot-Watt University, Edinburgh, UK;School of Math. and Comp. Sciences, Heriot-Watt University, Edinburgh, UK
Venue:
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Year:
2011

Citing 10
Cited 2

Computing with membranes

Journal of Computer and System Sciences
Handbook of Theoretical Computer Science

Handbook of Theoretical Computer Science
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Computation: finite and infinite machines

Computation: finite and infinite machines
P systems with minimal parallelism

Theoretical Computer Science
Computing with Cells: Advances in Membrane Computing

Computing with Cells: Advances in Membrane Computing
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
A formal framework for static (tissue) P systems

WMC'07 Proceedings of the 8th international conference on Membrane computing
P systems with elementary active membranes: beyond NP and coNP

CMC'10 Proceedings of the 11th international conference on Membrane computing
Power and efficiency of minimal parallelism in polarizationless P systems

Journal of Automata, Languages and Combinatorics

Asynchronous P systems with active membranes

Theoretical Computer Science
On efficient algorithms for SAT

CMC'12 Proceedings of the 13th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that P systems with active membranes operating under minimal parallelism are able to solve NP-complete and PP-complete problems in linear time and exponential space when using different types of rules. We also prove that these systems can simulate register machines.