Communicative p systems with minimal cooperation

Authors:
Artiom Alhazov;Maurice Margenstern;Vladimir Rogozhin;Yurii Rogozhin;Sergey Verlan
Affiliations:
Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişinău, Moldova;LITA, Université de Metz, France;State University of Moldova, Chişinău, Moldova;Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişinău, Moldova;LITA, Université de Metz, France
Venue:
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Year:
2004

Citing 8
Cited 12

Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
GP Systems with forbidding context

Fundamenta Informaticae - Membrane computing
The power of communication: P systems with symport/antiport

New Generation Computing
Membrane Systems with Symport/Antiport Rules: Universality Results

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Simulating Counter Automata by P Systems with Symport/Antiport

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computation: finite and infinite machines

Computation: finite and infinite machines
On the size of p systems with minimal symport/antiport

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Symport/Antiport P Systems with Three Objects Are Universal

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
P Systems with Proteins on Membranes

Fundamenta Informaticae
On the Branching Complexity of P Systems

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Skin output in P systems with minimal symport/antiport and two membranes

WMC'07 Proceedings of the 8th international conference on Membrane computing
Event-related outputs of computations in P systems

Journal of Automata, Languages and Combinatorics
Towards a characterization of p systems with minimal symport/antiport and two membranes

WMC'06 Proceedings of the 7th international conference on Membrane Computing
Computational power of symport/antiport: history, advances, and open problems

WMC'05 Proceedings of the 6th international conference on Membrane Computing
Tissue p systems with minimal symport/antiport

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
P systems with proteins on membranes and membrane division

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
P Systems with Proteins on Membranes

Fundamenta Informaticae
On the Branching Complexity of P Systems

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Symport/Antiport P Systems with Three Objects Are Universal

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.