Communicative P Systems with Minimal Cooperation

13 years 10 months ago

Download combio.abo.fi

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.

Artiom Alhazov, Maurice Margenstern, Vladimir Rogo

Real-time Traffic

MEMBRANE 2004 | Minimal Cooperation | Nonnegative Integers | Systems |

claim paper

» Minimal Parallelism for Polarizationless P Systems

» Power and Efficiency of Minimal Parallelism in Polarizationless P Systems

» Minimizing Average Finish Time in P2P Networks

» comDesk A Cooperative Assistance Tool Based on P2P Techniques

» Bounds on the Performance of P2P Networks Using TitforTat Strategies

» On the Power of Deterministic and Sequential Communicating P Systems

» Analysis of Adaptive Incentive Protocols for P2P Networks

» A TrustBased Exchange Framework for Multiple Services in P2P Systems

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	MEMBRANE
Authors	Artiom Alhazov, Maurice Margenstern, Vladimir Rogozhin, Yurii Rogozhin, Sergey Verlan

Comments (0)

Sciweavers

Communicative P Systems with Minimal Cooperation

MEMBRANE 2004 | Minimal Cooperation | Nonnegative Integers | Systems |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers