Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings

Authors:
Rudolf Freund;Marion Oswald
Affiliations:
Faculty of Informatics, Vienna University of Technology, Favoritenstr. 9-11, 1040 Vienna, Austria;Faculty of Informatics, Vienna University of Technology, Favoritenstr. 9-11, 1040 Vienna, Austria
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 6
Cited 1

Handbook of Formal Languages

Handbook of Formal Languages
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Computation: finite and infinite machines

Computation: finite and infinite machines
On the computational power of the mate/bud/drip brane calculus: interleaving vs. maximal parallelism

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

CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Brane calculi

CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology

An integrating view on DNA computing and membrane computing

EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate tissue P systems with (non-restricted, symmetric) versions of mate and drip operations and prove that such systems are computationally complete with the minimal number of two cells when working on strings. Moreover, we consider the variant of scattered context tissue P systems with mate and drip operations and show a similar computational completeness result with using at most four cells during any computation. In all cases, the corresponding results for (mem)brane systems are established, too.