Membrane automata with priorities

In this paper the one-way P automata with priorities are introduced. Such automata are P systems where the membranes are only allowed to consume objects from parent membranes, under the given conditions. The result of computation of these systems is the set of multiset sequences consumed by skin membrane into the system. The rules associated in some order with each membrane, cannot modify any objects, they can only move them through membrane. We show that P automata with priorities and two membranes can accept every recursively enumerated language. Luděk Cienciala received the M.S. degree from the University of Ostrava in 1996. He is currently an assistant professor in the Institute of Computer Science of the Faculty of Philosophy and Science of Silesian University in Opava. His research interests are formal language theory and computer graphics. Lucie Ciencialová received the B.S. degree in applicated mathematics of economic from the Mathematical Institute of Silesian University in Opava. She is currently studing at the Silesian University in Opava. Her research interests are in formal language theory.