Communicative P Systems with Minimal Cooperation

We proved 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.

• Type: Conference
• Year: 2004
• Where: MEMBRANE
• Authors: Artiom Alhazov, Maurice Margenstern, Vladimir Rogozhin, Yurii Rogozhin, Sergey Verlan
• Keywords: MEMBRANE 2004, Minimal Cooperation, Nonnegative Integers, Systems