Membrane Automata with Priorities

In this paper the one-way P automata with priorities are introduced. Suchautomata are P systems where the membranes are only allowed to consume objects from parentmembranes, under the given conditions. The result of computation of these systems is the set ofmultiset sequences consumed by skin membrane into the system. The rules associated in some orderwith each membrane cannot modify any objects, they can only move them through membrane. We show thatP automata with priorities and two membranes can accept every recursively enumerated language.

具有优先权的膜自动机

膜系统是由Gheorghe Paun受细胞生化特性启发而提出的一种分布式平行计算模型。该模型由有等级嵌入到最外层的外壳膜的膜组成，每一个膜划出一块可以包含物体的区域。这些物体对应于化学物质，在由膜限定的细胞器中发展和变化；物体可以穿过膜并摧毁膜。每一区域都有一套相关规则，物体依照这些规则发展或被运输到它们的母区域或子区域。