作者: Erzsébet Csuhaj-Varjú , György Vaszil , Sergey Verlan
DOI: 10.1007/978-3-642-18123-8_14
关键词:
摘要: Generalized communicating P systems (GCPSs) are tissuelike membrane with only rules for moving pairs of objects. Despite their simplicity, they able to generate any recursively enumerable set numbers even having restricted variants communication rules. We show that GCPSs still remain computationally complete if given a singleton alphabet objects and one the types rules: parallel-shift, join, presence-move, or chain.