On Generalized Communicating P Systems with One Symbol
Generalized communicating P systems (GCPSs) are tissue-like membrane systems with only rules for moving pairs of objects. Despite their simplicity, they are able to generate any recursively enumerable set of numbers even having restricted variants of communication rules. We show that GCPSs still remain computationally complete if they are given with a singleton alphabet of objects and with only one of the restricted types of rules: parallel-shift, join, presence-move, or chain.
KeywordsMain Block Minimal Interaction Interaction Rule Register Machine Communication Rule
Unable to display preview. Download preview PDF.
- 1.Alhazov, A., Freund, R., Oswald, M., Verlan, S.: Partial versus total halting in P systems. In: Gutiérrez-Naranjo, M.A., et al. (eds.) Proceedings of the Fifth Brainstorming Week on Membrane Computing, Sevilla, pp. 1–20 (2007)Google Scholar
- 4.Csuhaj-Varjú, E., Verlan, S.: On generalized communicating P systems with minimal interaction rules. Theoretical Computer Science (to appear)Google Scholar
- 12.The P systems webpage, http://ppage.psystems.eu