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

5 Citations (Scopus)

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages160-174
Number of pages15
Volume6501 LNCS
DOIs
Publication statusPublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

P Systems
Tissue
Membranes
Communication
Recursively Enumerable Set
Even number
Join
Simplicity
Membrane
Object

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

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). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6501 LNCS). https://doi.org/10.1007/978-3-642-18123-8-14

On generalized communicating P systems with one symbol. / Csuhaj-Varjú, E.; Vaszil, György; Verlan, Sergey.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6501 LNCS 2010. p. 160-174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6501 LNCS).

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

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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6501 LNCS, pp. 160-174, 11th International Conference on Membrane Computing, CMC 2010, Jena, Germany, 8/24/10. https://doi.org/10.1007/978-3-642-18123-8-14
Csuhaj-Varjú E, Vaszil G, Verlan S. 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. 2010. p. 160-174. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-18123-8-14
Csuhaj-Varjú, E. ; Vaszil, György ; Verlan, Sergey. / On generalized communicating P systems with one symbol. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6501 LNCS 2010. pp. 160-174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bcb6937dbbf24a1dbd5afd122bb63f7c,
title = "On generalized communicating P systems with one symbol",
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.",
author = "E. Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil and Sergey Verlan",
year = "2010",
doi = "10.1007/978-3-642-18123-8-14",
language = "English",
isbn = "3642181228",
volume = "6501 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "160--174",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - On generalized communicating P systems with one symbol

AU - Csuhaj-Varjú, E.

AU - Vaszil, György

AU - Verlan, Sergey

PY - 2010

Y1 - 2010

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

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

UR - http://www.scopus.com/inward/record.url?scp=79251562162&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79251562162&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-18123-8-14

DO - 10.1007/978-3-642-18123-8-14

M3 - Conference contribution

SN - 3642181228

SN - 9783642181221

VL - 6501 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 160

EP - 174

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -