Computational Completeness of P Systems with Active Membranes and Two Polarizations

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.