Abstract
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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Csuhaj-Varjú, E., Vaszil, G., & Verlan, S. (2010). On generalized communicating P systems with one symbol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6501 LNCS, pp. 160–174). Springer Verlag. https://doi.org/10.1007/978-3-642-18123-8_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
