On generalized communicating P systems with minimal interaction rules

Authors:
Erzsébet Csuhaj-Varjú;Sergey Verlan
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende u. 13-17, 1111 Budapest, Hungary and Eötvös Loránd University, Faculty of Informatics, Department of ...;Laboratoire dAlgorithmique, Complexité et Logique, Département Informatique, Université Paris Est, 61, av. Général de Gaulle, 94010 Créteil, France
Venue:
Theoretical Computer Science
Year:
2011

Citing 9
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
Computational completeness of tissue p systems with conditional uniport

WMC'06 Proceedings of the 7th international conference on Membrane Computing
Computational power of symport/antiport: history, advances, and open problems

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

On generalized communicating P systems with one symbol

CMC'10 Proceedings of the 11th international conference on Membrane computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

Generalized communicating P systems are purely communicating tissue-like membrane systems with communication rules which allow the movement of only pairs of objects. In this paper, we study the power of these systems in the case of eight restricted variants of communication rules. We show that seven of these restrictions lead to computational completeness, while using the remaining one the systems are able to compute only finite singletons of non-negative integers. The obtained results complete the investigations of the computational power of generalized communicating P systems and provide further examples for simple architectures with simple functioning rules which are as powerful as Turing machines.