Skip to main content

Sublinear-Space P Systems with Active Membranes

  • Conference paper
Membrane Computing (CMC 2012)

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

Included in the following conference series:

Abstract

We introduce a weak uniformity condition for families of P systems, DLOGTIME uniformity, inspired by Boolean circuit complexity. We then prove that DLOGTIME-uniform families of P systems with active membranes working in logarithmic space (not counting their input) can simulate logarithmic-space deterministic Turing machines.

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. Alhazov, A., Leporati, A., Mauri, G., Porreca, A.E., Zandron, C.: The computational power of exponential-space P systems with active membranes. In: Martínez-del-Amor, M.A., Păun, G., Pérez-Hurtado, I., Romero-Campero, F.J. (eds.) Proceedings of the Tenth Brainstorming Week on Membrane Computing, vol. I, pp. 35–60. Fénix Editora (2012)

    Google Scholar 

  2. Mix Barrington, D.A., Immerman, N., Straubing, H.: On uniformity within \(\textrm{NC}^1\). Journal of Computer and System Sciences 41(3), 274–306 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  3. Murphy, N., Woods, D.: The computational power of membrane systems under tight uniformity conditions. Natural Computing 10(1), 613–632 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Păun, G.: P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)

    MathSciNet  MATH  Google Scholar 

  5. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Complexity classes in models of cellular computing with membranes. Natural Computing 2(3), 265–284 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Introducing a space complexity measure for P systems. International Journal of Computers, Communications & Control 4(3), 301–310 (2009)

    Google Scholar 

  7. Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: P systems with active membranes working in polynomial space. International Journal of Foundations of Computer Science 22(1), 65–73 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ruzzo, W.L.: On uniform circuit complexity. Journal of Computer and System Sciences 22(3), 365–383 (1981)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Porreca, A.E., Leporati, A., Mauri, G., Zandron, C. (2013). Sublinear-Space P Systems with Active Membranes. In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, G. (eds) Membrane Computing. CMC 2012. Lecture Notes in Computer Science, vol 7762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36751-9_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36751-9_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36750-2

  • Online ISBN: 978-3-642-36751-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics