摘要
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.
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.
