Towards bridging two cell-inspired models: P systems and R systems

Authors:
Gheorghe Pun;Mario J. Pérez-Jiménez
Affiliations:
Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700 Bucureti, Romania and Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, Univer ...;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012 Sevilla, Spain
Venue:
Theoretical Computer Science
Year:
2012

Citing 11
Cited 1

Computing with membranes

Journal of Computer and System Sciences
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Computationally universal P systems without priorities: two catalysts are sufficient

Theoretical Computer Science - Descriptional complexity of formal systems
Reaction Systems

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Events and modules in reaction systems

Theoretical Computer Science
Introducing time in reaction systems

Theoretical Computer Science
Computing with Cells: Advances in Membrane Computing

Computing with Cells: Advances in Membrane Computing
Reaction systems: a model of computation inspired by biochemistry

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Basic notions of reaction systems

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Membrane Systems with Qualitative Evolution Rules

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday

Bridging Membrane and Reaction Systems --Further Results and Research Topics

Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday

Quantified Score

Hi-index	5.23

Visualization

Abstract

We examine, from the point of view of membrane computing, the two basic assumptions of reaction systems, the ''threshold'' and ''no permanence'' ones. In certain circumstances (e.g., defining the successful computations by local halting), the second assumption can be incorporated in a transition P system or in a symport/antiport P system without losing the universality. The case of the first postulate remains open: the reaction systems deal, deterministically, with finite sets of symbols, which is not of much interest for computing; three ways to introduce nondeterminism are suggested and left as research topics.