On the efficiency of p systems with active membranes and two polarizations

Authors:
Artiom Alhazov;Rudolf Freund
Affiliations:
Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Faculty of Informatics, Vienna University of Technology, Wien, Austria
Venue:
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Year:
2004

Citing 8
Cited 11

Handbook of Formal Languages

Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
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
On P Systems with Active Membranes Solving the Integer Factorization Problem in a Polynomial Time

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
On P Systems with Global Rules

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
From regulated rewriting to computing with membranes: collapsing hierarchies

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

Fundamenta Informaticae

P Systems with Mobile Membranes

Natural Computing: an international journal
Further remark on P systems with active membranes and two polarizations

Journal of Parallel and Distributed Computing
On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution

Fundamenta Informaticae
P systems with active membranes: trading time for space

Natural Computing: an international journal
A Σ2P∪ Π2Plower bound using mobile membranes

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On the power of dissolution in p systems with active membranes

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

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
On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution

Fundamenta Informaticae
On efficient algorithms for SAT

CMC'12 Proceedings of the 13th international conference on Membrane Computing
Time-free solution to SAT problem using P systems with active membranes

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for deterministically deciding SAT in linear time by P systems with active membranes using only two polarizations and rules of types (a), (c), and (e). Moreover, various restrictions on the general form of the rules are considered: global, non-renaming, independent of the polarization, preserving it, changing it, producing two membranes with different polarizations, having exactly one or two objects in (each membrane of) the right-hand side, thus improving results from [1]. Several problems related to different combinations of these restrictions are formulated, too.