Membrane Dissolution and Division in P

Authors:
Damien Woods;Niall Murphy;Mario J. Pérez-Jiménez;Agustín Riscos-Núñez
Affiliations:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Seville, Spain;Department of Computer Science, National University of Ireland Maynooth, Ireland;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Seville, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Seville, Spain
Venue:
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Year:
2009

Citing 9
Cited 1

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
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
The computational power of cell division in P systems: Beating down parallel computers?

Natural Computing: an international journal
Membrane computing and complexity theory: A characterization of PSPACE

Journal of Computer and System Sciences
On a Păun's Conjecture in Membrane Systems

IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
A Characterisation of NL Using Membrane Systems without Charges and Dissolution

UC '08 Proceedings of the 7th international conference on Unconventional Computing
Active membrane systems without charges and using only symmetric elementary division characterise P

WMC'07 Proceedings of the 8th international conference on Membrane computing

A computational complexity theory in membrane computing

WMC'09 Proceedings of the 10th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polynomial time. However, we give a P upperbound on an important restriction of such systems. In particular we examine systems with dissolution, elementary division and where each membrane initially has at most one child membrane. Even though such systems may create exponentially many membranes, each with different contents, we show that their power is upperbounded by P.