P systems with active membranes and without polarizations

Authors:
Rudolf Freund;Andrei Păun
Affiliations:
Faculty of Informatics, Vienna University of Technology, Favoritenstr. 9, A-1040, Wien, Austria;Department of Computer Science, Louisiana Tech University, PO Box 10348, Ruston, 71272, Louisiana, LA, USA
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Year:
2005

Citing 0
Cited 1

P systems generating trees

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

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. In particular, allowing for changing membrane labels turns out to be a very powerful control feature.