Communicative P Systems with Minimal Cooperation

We prove that two classes of communicative P systems with 3 membranes and with minimal cooperation, namely P systems with symport/antiport rules of size 1 and and P systems with symport rules of size 2, are computationally complete: they generate all recursively enumerable sets of vectors of nonnegative integers. The result of computation is obtained in the elementary membrane.

[1]  Andrei Paun,et al.  Universality of Minimal Symport/Antiport: Five Membranes Suffice , 2003, Workshop on Membrane Computing.

[2]  Andrei Paun,et al.  On the Power of P Systems with Symport Rules , 2002, J. Univers. Comput. Sci..

[3]  Rudolf Freund,et al.  Membrane Systems with Symport/Antiport Rules: Universality Results , 2002, WMC-CdeA.

[4]  Grzegorz Rozenberg,et al.  Aspects of Molecular Computing , 2004, Lecture Notes in Computer Science.

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

[6]  Pierluigi Frisco.  About P systems with symport/antiport , 2005, Soft Comput..

[7]  Andrei Paun,et al.  On the Universality of P Systems with Minimal Symport/Antiport Rules , 2004, Aspects of Molecular Computing.

[8]  Hendrik Jan Hoogeboom,et al.  Simulating Counter Automata by P Systems with Symport/Antiport , 2002, WMC-CdeA.

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

[10]  György Vaszil.  On the Size of P Systems with Minimal Symport/Antiport , 2004, Workshop on Membrane Computing.

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