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 iof Moldova, Str. Academiei 5, Chişinău, MD 2028, Moldova and Research Group on Mathematical Linguistics, Rovira i Vir ...;Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005 Tarragona, Spain;Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005 Tarragona, Spain and Department of Control Science and Engineering, Huazhong University ...
Venue:
Fundamenta Informaticae
Year:
2003

Citing 8
Cited 5

The second machine class: models of parallelism

Parallel computers and computations
Structural complexity 2

Structural complexity 2
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

Solving multidimensional 0--1 knapsack problem by P systems with input and active membranes

Journal of Parallel and Distributed Computing
Tissue p systems with cell separation: upper bound by PSPACE

TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
Spiking neural P systems with anti-spikes and without annihilating priority working in a 'flip-flop' way

International Journal of Computing Science and Mathematics
Time-free solution to SAT problem using P systems with active membranes

Theoretical Computer Science
Space complexity equivalence of P systems with active membranes and Turing machines

Theoretical Computer Science

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.