Computability power of mobility in enhanced mobile membranes

Authors:
Shankara Narayanan Krishna;Gabriel Ciobanu
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Mumbai, India;Institute of Computer Science, Romanian Academy, Iasi, Romania and Facultatea de Informatică, Universitatea "Al. I. Cuza", Iaşi, Romania
Venue:
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Year:
2011

Citing 8
Cited 1

Formal languages

Formal languages
Computing with membranes

Journal of Computer and System Sciences
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Computation: finite and infinite machines

Computation: finite and infinite machines
Describing the Immune System Using Enhanced Mobile Membranes

Electronic Notes in Theoretical Computer Science (ENTCS)
On the Computational Power of Enhanced Mobile Membranes

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing

On the computability power of membrane systems with controlled mobility

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore the computability power of the various forms of mobility in membrane computing. First we improve a previous computational completeness result by showing that 5 membranes together with endo, exo, fendo and fexo operations are enough for Turing completeness (it is known that 3 membranes do not suffice). Then we show that 10 membranes along with fendo, fexo; 9 membranes with endo, exo, pendo; 8 membranes with fendo, fexo, pendo and 12 membranes with endo, exo, fendo give computational completeness. When we look at restricted mobility described by rendo, rexo, rfendo and rfexo, we show that they do not give computational completeness; moreover, adding pure mobility to the restricted operations does not lead to the level of RE.