Active membrane systems without charges and using only symmetric elementary division characterise P

Authors:
Niall Murphy;Damien Woods
Affiliations:
Department of Computer Science, National University of Ireland, Maynooth, Ireland;Department of Computer Science, University College Cork, Ireland
Venue:
WMC'07 Proceedings of the 8th international conference on Membrane computing
Year:
2007

Citing 6
Cited 4

Structural complexity 1

Structural complexity 1
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
The circuit value problem is log space complete for P

ACM SIGACT News
Membrane computing and complexity theory: A characterization of PSPACE

Journal of Computer and System Sciences

A Characterisation of NL Using Membrane Systems without Charges and Dissolution

UC '08 Proceedings of the 7th international conference on Unconventional Computing
Membrane Dissolution and Division in P

UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Selected topics in computational complexity of membrane systems

Computation, cooperation, and life
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

In this paper we introduce a variant of membrane systems with elementary division and without charges. We allow only elementary division where the resulting membranes are identical; we refer to this using the biological term symmetric division. We prove that this model characterises P and introduce logspace uniform families. This result characterises the power of a class of membrane systems that fall under the so-called P conjecture for membrane systems.