On P Systems with Membrane Creation

Abstract

We first give a general result about P systems with symbol-objects, which says that systems with membrane creation with only one initial membrane can simulate usual systems without using additional membranes (and this implies as a direct consequence a recent result of Mutyam and Krithivasan), then we extend the membrane creation feature to P systems with string-objects and we prove the computational universality of such systems.

Keywords

• Molecular computing
• membrane computing
• recursively enumerable sets
• matrix grammars