On Generalized Communicating P Systems with One Symbol

被引：0
|
作者：
Csuhaj-Varju, Erzsebet [1 ]
Vaszil, Gyoergy [1 ]
Verlan, Sergey [2 ]
机构：
[1] Hungarian Acad Sci, Comp & Automat Res Inst, Kende U 13-17, H-1111 Budapest, Hungary
[2] Univ Paris Est, Dept Informat, LabAlgorithmique Complexe Logique, Creteil, France
来源：
MEMBRANE COMPUTING | 2010年 / 6501卷
基金：
匈牙利科学研究基金会;
关键词：
SYMPORT/ANTIPORT; POWER;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：160 / +
页数：2
相关论文
共 50 条
  • [1] Generalized communicating P systems
    Verlan, Sergey
    Bernardini, Francesco
    Gheorghe, Marian
    Margenstern, Maurice
    THEORETICAL COMPUTER SCIENCE, 2008, 404 (1-2) : 170 - 184
  • [2] On generalized communicating P systems with minimal interaction rules
    Csuhaj-Varju, Erzsebet
    Verlan, Sergey
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (1-2) : 124 - 135
  • [3] Dynamically Changing Environment for Generalized Communicating P Systems
    Balasko, Akos
    Csuhaj-Varju, Erzsebet
    Vaszil, Gyorgy
    MEMBRANE COMPUTING (CMC 2015), 2015, 9504 : 92 - 105
  • [4] ON A WORKFLOW MODEL BASED ON GENERALIZED COMMUNICATING P SYSTEMS
    Balasko, Akos
    COMPUTER SCIENCE-AGH, 2016, 17 (01): : 45 - 68
  • [5] Generalized Communicating P Systems Working in Fair Sequential Mode
    Spicher, Antoine
    Verlan, Sergey
    SCIENTIFIC ANNALS OF COMPUTER SCIENCE, 2011, 21 (02) : 227 - 247
  • [6] P automata or purely communicating accepting P systems
    Csuhaj-Varjú, E
    Vaszil, G
    MEMBRANE COMPUTING, 2003, 2597 : 219 - 233
  • [7] Eilenberg P systems with symbol-objects
    Bernardini, R
    Gheorghe, M
    Holcombe, M
    ASPECTS OF MOLECULAR COMPUTING, 2004, 2950 : 49 - 60
  • [8] On the power of deterministic and sequential communicating P systems
    Cienciala, Ludek
    Ciencialova, Lucie
    Frisco, Pierluigi
    Sosik, Petr
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (02) : 415 - 431
  • [9] Further results on generalised communicating P systems
    Krishna, Shankara Narayanan
    Gheorghe, Marian
    Ipate, Florentin
    Csuhaj-Varju, Erzsebet
    Ceterchi, Rodica
    THEORETICAL COMPUTER SCIENCE, 2017, 701 : 146 - 160
  • [10] A generalized Vaserstein symbol
    Syed, Tariq
    ANNALS OF K-THEORY, 2019, 4 (04) : 671 - 706
12345