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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bernardini, F., Gheorghe, M.: On the Power of Minimal Symport/Antyport. Pre-proceedings of Workshop on Membrane Computing, WMC 2003, Tarragona, July 17–22 (2003), Technical Report No 28/03, RGML, Universitat Rovira i Virgili, Tarragona, 72–83 (2003)
Bernardini, F., Păun, A.: Universality of Minimal Symport/Antiport: Five Membranes Suffice. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 43–45. Springer, Heidelberg (2004)
Freund, R., Oswald, M.: GP Systems with Forbidding Contexts. Fundamenta Informaticae 49(1-3), 81–102 (2002)
Freund, R., Păun, A.: Membrane Systems with Symport/Antiport: Universality Results. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 270–287. Springer, Heidelberg (2003)
Frisco, P.: About P Systems with Symport/Antiport. In: Proceedings of the Second Brainstorming Week on Membrane Computing, TR 01/2004, RGNC, Sevilla University, pp. 224–236 (2004)
Frisco, P., Hoogeboom, J.H.: Simulating Counter Automata by P Systems with Symport/Antypot. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 288–301. Springer, Heidelberg (2003)
Kari, L., Martin-Vide, C., Păun, A.: On the universality of P systems with Minimal Symport/Antiport Rules. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 254–265. Springer, Heidelberg (2003)
Margenstern, M., Rogozhin, V., Rogozhin, Y., Verlan, S.: About P Systems with Minimal Symport/Antiport Rules and Four Membranes. In: Pre-Proceedings of Fifth Workshop on Membrane Computing, WMC5, Milano-Bicocca, Italy, pp. 283–294 (2004)
Martin-Vide, C., Păun, A., Păun, G.: On the Power of P systems with Symport and Antiport rules. Journal of Universal Computer Science 8, 295–305 (2002)
Minsky, M.L.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)
Păun, A., Păun, G.: The Power of Communication: P systems with Symport/Antiport. New Generation Computing 20, 295–305 (2002)
Păun, G.: Computing with Membranes. Journal of Computer and Systems Sciences 61, 108–143 (2000)
Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)
Vaszil, G.: On the size of P systems with minimal symport/antiport. In: Pre-Proceedings of Fifth Workshop on Membrane Computing, WMC5, Milano-Bicocca, Italy, pp. 422–431 (2004)
The P systems web page, http://psystems.disco.unimib.it/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alhazov, A., Margenstern, M., Rogozhin, V., Rogozhin, Y., Verlan, S. (2005). Communicative P Systems with Minimal Cooperation. In: Mauri, G., Păun, G., Pérez-Jiménez, M.J., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2004. Lecture Notes in Computer Science, vol 3365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31837-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-31837-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25080-7
Online ISBN: 978-3-540-31837-8
eBook Packages: Computer ScienceComputer Science (R0)