You are here: TUCS > PUBLICATIONS > Publication Search > Communicative P Systems with M...
Communicative P Systems with Minimal Cooperation
Artiom Alhazov, Maurice Margenstern, Vladimir Rogozhin, Yurii Rogozhin, Sergey Verlan, Communicative P Systems with Minimal Cooperation. In: Gh. Paun M.J. Perez-Jimenez G. Rozenberg A. Salomaa G. Mauri (Ed.), Membrane Computing, 5th International Workshop, WMC 2004, Milan, Italy, June 14-16, 2004, Revised Selected and Invited Papers, Lecture Notes in Computer Science 3365, 161–177, Springer-Verlag, Berlin, 2005.
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.
Files:
Full publication in PDF-format
BibTeX entry:
@INPROCEEDINGS{inpAlMaRoRoVe05a,
title = {Communicative P Systems with Minimal Cooperation},
booktitle = {Membrane Computing, 5th International Workshop, WMC 2004, Milan, Italy, June 14-16, 2004, Revised Selected and Invited Papers},
author = {Alhazov, Artiom and Margenstern, Maurice and Rogozhin, Vladimir and Rogozhin, Yurii and Verlan, Sergey},
volume = {3365},
series = {Lecture Notes in Computer Science},
editor = {G. Mauri, Gh. Paun M.J. Perez-Jimenez G. Rozenberg A. Salomaa},
publisher = {Springer-Verlag, Berlin},
pages = {161–177},
year = {2005},
}
Belongs to TUCS Research Unit(s): Computational Biomodeling Laboratory (Combio Lab)
Publication Forum rating of this publication: level 1