On Generalized Communicating P Systems with One Symbol
On Generalized Communicating P Systems with One Symbol
复制标题
DOI：
10.1007/978-3-642-18123-8_14
复制
发表时间：
2010-08
期刊：
影响因子：
--
通讯作者：
E. Csuhaj-Varjú;György Vaszil;Sergey Verlan
中科院分区：
文献类型：
--
作者：
E. Csuhaj-Varjú;György Vaszil;Sergey Verlan
广义通信P系统（gcps）是类组织的膜系统，只有物体对移动的规则。尽管它们很简单，但它们能够生成任何递归可枚举的数字集，甚至具有受限制的通信规则变体。我们证明，如果gcps具有单一的对象字母表并且仅具有一种限制类型的规则：并行移动，连接，存在移动或链，则gcps仍然保持计算完备。
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.