On generalized communicating P systems with one symbol

Authors:
Erzsébet Csuhaj-Varjú;György Vaszil;Sergey Verlan
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences and Department of Algorithms and Their Applications, Faculty of Informatics, Eötvös Loránd University, Buda ...;Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary;Laboratoire d'Algorithmique, Complexité et Logique, Département Informatique, Université Paris Est, Créteil, France
Venue:
CMC'10 Proceedings of the 11th international conference on Membrane computing
Year:
2010

Citing 10
Cited 1

Handbook of Formal Languages

Handbook of Formal Languages
Membrane Computing: An Introduction

Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport

New Generation Computing
Tissue P systems

Theoretical Computer Science
Computation: finite and infinite machines

Computation: finite and infinite machines
Generalized communicating P systems

Theoretical Computer Science
Producer/Consumer in Membrane Systems and Petri Nets

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
On generalized communicating P systems with minimal interaction rules

Theoretical Computer Science
Computational power of symport/antiport: history, advances, and open problems

WMC'05 Proceedings of the 6th international conference on Membrane Computing

Properties of membrane systems

CMC'11 Proceedings of the 12th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Generalized communicating P systems (GCPSs) are tissuelike 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.