P Systems with String Objects and with Communication by Request
In this paper we study P systems using string-objects where the communication between the regions is indicated by the occurrence of so-called query symbols in the string. We define two variants of communication and prove that these systems with both types of communication are computationally complete, even having a number of membranes limited with relatively small constants.
Unable to display preview. Download preview PDF.
- 2.Csuhaj-Varjú, E., Păun, G., Vaszil, G.: Tissue-like P systems communicating by request. In: Krithivasan, K., Rama, R. (eds.) Formal Language Aspects of Natural Computing. Ramanujan Mathematical Society Lecture Notes Series, vol. 3, pp. 143–153, Ramanujan Mathematical Society (2006)Google Scholar
- 5.Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000) (and Turku Center for Computer Science-TUCS Report 208 (November 1998), www.tucs.fi)
- 6.Păun, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)Google Scholar