A Normal form for P-Systems

The P-systems have been recently introduced in [4] as a new model for distributed parallel computing. We describe in this paper a normal form for the class of non-cooperative P-systems and prove a normalization theorem. By this result, we also prove that the hierarchy of non-cooperative P-systems with respect to depth collapses on the second level.

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

[2]  David Thomas,et al.  The Art in Computer Programming , 2001 .

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

[4]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

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

[6]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .