A toolbox for simpler active membrane algorithms

We show that recogniser P systems with active membranes can be augmented with a priority over their set of rules and any number of membrane charges without loss of generality, as they can be simulated by standard P systems with active membranes, in particular using only two charges. Furthermore, we show that more general accepting conditions, such as sending out several, possibly contradictory results and keeping only the first one, or rejecting by halting without output, are also equivalent to the standard accepting conditions. The simulations we propose are always without significant loss of efficiency, and thus the results of this paper can hopefully simplify the design of algorithms for P systems with active membranes.

Authors

• Alberto Leporati
• Luca Manzoni
• Giancarlo Mauri
• Antonio E. Porreca
• Claudio Zandron

Keywords

• Membrane computing
• Computational complexity
• P system with active membranes