On Generalized Communicating P Systems with One Symbol

E. Csuhaj-Varjú, György Vaszil, Sergey Verlan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationMembrane Computing - 11th International Conference, CMC 2010, Revised Selected Papers
PublisherSpringer Verlag
Pages160-174
Number of pages15
ISBN (Print)9783642181221
DOIs
Publication statusPublished - Jan 1 2010
Event11th International Conference on Membrane Computing, CMC 2010 - Jena, Germany
Duration: Aug 24 2010Aug 27 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6501 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Conference on Membrane Computing, CMC 2010
CountryGermany
CityJena
Period8/24/108/27/10

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Csuhaj-Varjú, E., Vaszil, G., & Verlan, S. (2010). On Generalized Communicating P Systems with One Symbol. In Membrane Computing - 11th International Conference, CMC 2010, Revised Selected Papers (pp. 160-174). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6501 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-18123-8_14