P Systems with Active Membranes and Without Polarizations

Abstract

P systems with active membranes but without using electrical charges (polarizations) are shown to be complete for generating recursively enumerable string languages when working on string objects and using only rules with membrane transitions as well as rules with membrane dissolving and elementary membrane division, but also when using various other kinds of rules, even including a new type of rules allowing for membrane generation. Especially, allowing for changing membrane labels turns out to be a very powerful control feature.