Skip to main content

Computability Power of Mobility in Enhanced Mobile Membranes

  • Conference paper
Models of Computation in Context (CiE 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6735))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aman, B., Ciobanu, G.: Describing the Immune System Using Enhanced Mobile Membranes. Electronic Notes in Theoretical Computer Science 194, 5–18 (2008)

    Article  MATH  Google Scholar 

  2. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Heidelberg (1989)

    Book  MATH  Google Scholar 

  3. Freund, R., Păun, G.: On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 214–225. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Krishna, S.N., Ciobanu, G.: On the Computational Power of Enhanced Mobile Membranes. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 326–335. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)

    MATH  Google Scholar 

  6. Păun, G.: Computing with Membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)

    MATH  Google Scholar 

  8. Salomaa, A.: Formal Languages. Academic Press, London (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krishna, S.N., Ciobanu, G. (2011). Computability Power of Mobility in Enhanced Mobile Membranes. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds) Models of Computation in Context. CiE 2011. Lecture Notes in Computer Science, vol 6735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21875-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21875-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21874-3

  • Online ISBN: 978-3-642-21875-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics