Computational completeness of p systems with active membranes and two polarizations

Authors:
Artiom Alhazov;Rudolf Freund;Gheorghe Păun
Affiliations:
Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Faculty of Informatics, Vienna University of Technology, Wien, Austria;Institute of Mathematics of the Romanian Academy, Bucureşti, Romania
Venue:
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Year:
2004

Citing 4
Cited 1

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
From regulated rewriting to computing with membranes: collapsing hierarchies

Theoretical Computer Science

Polarizationless P systems with active membranes working in the minimally parallel mode

UC'07 Proceedings of the 6th international conference on Unconventional Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

P systems with active membranes using only two electrical charges and only rules of type $\left( a\right) ,$ i.e., evolution rules used in parallel in the regions of the membrane system, and of type $\left( c\right) ,$ i.e., communication rules sending out an object of a membrane thereby possibly changing the polarization of this membrane, assigned to at most two membranes are shown to be computationally complete, which improves the previous result of this type with respect to the number of polarizations as well as to the number of membranes. Allowing a special variant $\left( c_{\lambda }\right) $ of rules of type $\left( c\right) $ to delete symbols by sending them out, even only one membrane is enough.