P Systems without Priorities Are Computationally Universal

The “classical” model of P systems was introduced by Gheorghe PĂun in 1998; this model with symbol objects was shown to be computationally universal in [8], provided that catalysts and priorities of rules are used. We now show by reduction via register machines that the priorities may be omitted from the model without loss of computational power. As a consequence, several universality results for P systems in [10] are improved.

[1]  B. Alberts,et al.  An Introduction to the Molecular Biology of the Cell , 1998 .

[2]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[3]  Vincenzo Manca,et al.  Dynamical aspects of P systems. , 2003, Bio Systems.

[4]  Rudolf Freund,et al.  GP Systems with Forbidding Context , 2002, Fundam. Informaticae.

[5]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[6]  Andrei Paun,et al.  ReMembrane Systems with Coupled Transport: Universality and Normal Forms , 2002, Fundam. Informaticae.

[7]  Gheorghe Paun,et al.  On Synchronization in P Systems , 1999, Fundam. Informaticae.

[8]  Gheorghe Paun,et al.  Computing with Membranes: An Introduction , 1999, Bull. EATCS.

[9]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[10]  Gheorghe Paun,et al.  On the Power of Membrane Computing , 1999, J. Univers. Comput. Sci..

[11]  Vincenzo Manca,et al.  Discrete dynamics in biological models , 2002 .

[12]  Cristian S. Calude,et al.  Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing , 2000 .

[13]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..