Membrane Systems Using Noncooperative Rules with Unconditional Halting

Authors:
Markus Beyreder;Rudolf Freund
Affiliations:
Faculty of Informatics, Vienna University of Technology, Wien, Austria A-1040;Faculty of Informatics, Vienna University of Technology, Wien, Austria A-1040
Venue:
Membrane Computing
Year:
2009

Citing 7
Cited 1

Computing with membranes

Journal of Computer and System Sciences
Handbook of Formal Languages

Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Tissue P systems

Theoretical Computer Science
Tissue P systems with channel states

Theoretical Computer Science - Insightful theory

(Tissue) p systems with hybrid transition modes

WMC'09 Proceedings of the 10th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider membrane systems using noncooperative rules, but considering computations without using halting conditions. As results of a computation we take the contents of a specified output membrane/cell in each transition step, no matter whether this computation will ever halt or not, eventually taking only results completely consisting of terminal objects only. The computational power of membrane systems using noncooperative rules turns out to be equivalent to that of Lindenmayer systems.