P systems with string objects and with communication by request

Summary. 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.