On the Computational Power of Flip-Flop Proteins on Membranes

Authors:
Shankara Narayanan Krishna
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Bombay, Powai, Mumbai,400 076, India
Venue:
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Year:
2007

Citing 7
Cited 0

Formal languages

Formal languages
Computing with membranes

Journal of Computer and System Sciences
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
Universality results for P systems based on brane calculi operations

Theoretical Computer Science
P Systems with Proteins on Membranes

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

P Systems with proteins on membranes were introduced recently by A.Paun and B. Popa, in an effort to bridge the gap between membrane computing and brane calculi. In this variant, one considers multisets of objects inside the membranes as well as proteins on the membranes. The action of the proteins on the objects is classified broadly into 5 categories. In this paper, we study the computational power of these actions and come up with upper and lower bounds in terms of computational power for some of them.