Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes

Authors:
Artiom Alhazov;Carlos Martín-Vide;Linqiang Pan
Affiliations:
Institute of Mathematics and Computer Science, Academy of Science of Moldova, Str. Academiei 5, Chisinau, MD 2028, Moldova;Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005 Tarragona, Spain;Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, Hubei, People's Republic of China
Venue:
Fundamenta Informaticae
Year:
2003

Citing 8
Cited 13

The second machine class: models of parallelism

Parallel computers and computations
Structural complexity 1

Structural complexity 1
Computing with membranes

Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Introduction to the Theory of Computation

Introduction to the Theory of Computation
Membrane Computing: An Introduction

Membrane Computing: An Introduction
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
Uniform solution of QSAT using polarizationless active membranes

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Computational complexity aspects in membrane computing

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
P systems with elementary active membranes: beyond NP and coNP

CMC'10 Proceedings of the 11th international conference on Membrane computing
An overview of membrane computing

ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Selected topics in computational complexity of membrane systems

Computation, cooperation, and life
P systems with active membranes characterize PSPACE

DNA'06 Proceedings of the 12th international conference on DNA Computing
On the efficiency of p systems with active membranes and two polarizations

WMC'04 Proceedings of the 5th international conference on Membrane Computing
A computational complexity theory in membrane computing

WMC'09 Proceedings of the 10th international conference on Membrane Computing
On the power of computing with proteins on membranes

WMC'09 Proceedings of the 10th international conference on Membrane Computing
An efficient simulation of polynomial-space turing machines by p systems with active membranes

WMC'09 Proceedings of the 10th international conference on Membrane Computing
P systems simulating oracle computations

CMC'11 Proceedings of the 12th international conference on Membrane Computing
A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

P systems are parallel molecular computing models based on processing multisets of objects in cell-like membrane structures. Recently, Petr Sosík has shown that a semi-uniform family of P systems with active membranes and 2-division is able to solve the PSPACE-complete problem QBF-SAT in linear time; he has also conjectured that the membrane dissolving rules of the (d) type may be omitted, but probably not the (f) type rules for non-elementary membrane division. In this paper, we partially confirm the conjecture proving that dissolving rules are not necessary. Moreover, the construction is now uniform. It still remains open whether or not non-elementary membrane division is needed.