Skip to main content
SpringerLink
Log in

Some Computational Issues in Membrane Computing

  • Conference paper
Mathematical Foundations of Computer Science 2005 (MFCS 2005)

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

  • 1345 Accesses

Abstract

Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, namely a P system, from natural phenomena of cell evolutions and chemical reactions. Because of the nature of maximal parallelism inherent in the model, P systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems (in much the same way as the promise of quantum and DNA computing) once future bio-technology (or silicon-technology) gives way to a practical bio-realization (or chip realization). Here we report on recent results that answer some interesting and fundamental open questions in the field. These concern computational issues such as determinism versus nondeterminism, membrane and alphabet-size hierarchies, and various notions of parallelism.

This wark was supported in part by NSF Grants CCR-0208595, CCF-0430945, and IIS-0451097. Some of the results reported here were obtained jointly with Zhe Dang, Sara Woodworth, and Hsu-Chun Yen.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Calude, C.S., Paun, G.:Computing with Cells and Atoms: After Five Years (new text added to Russian edition of the book with the same title first published by Taylor and Francis Publishers, London) (2001); To be published by Pushchino Publishing House (2004)

    Google Scholar 

  2. Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, G.: On the computational complexity of P automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 97–106. Springer, Heidelberg (2004)

    Google Scholar 

  3. Dang, Z., Ibarra, O.H.: On P systems operating in sequential and limited parallel modes. In: Pre-Proc. 6th Workshop on Descriptional Complexity of Formal Systems (2004)

    Google Scholar 

  4. Li, C., Dang, Z., Ibarra, O.H., Yen, H.-C.: Signaling P systems and verification problems. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1462–1473. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Dang, Z., Ibarra, O.H., Li, C., Xie, G.: On model-checking of P systems (Submitted)

    Google Scholar 

  6. Freund, R.: Sequential P-systems (2000), Available at http://psystems.disco.unimib.it

  7. Freund, R.: Asynchronous P systems. In: Mauri, G., Paun, G., Zandron, C. (eds.) Pre-Proc. Fifth Workshop on Membrane Computing (2004)

    Google Scholar 

  8. Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally universal P systems without priorities: two catalysts are sufficient. Theoretical Computer Science 330(2), 251–266 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Freund, R., Paun, A.: Membrane systems with symport/antiport rules: universality results. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, Springer, Heidelberg (2003)

    Google Scholar 

  10. Freund, R., Paun, G.: On deterministic P systems (2003), Available at http://psystems.disco.unimib.it

  11. Frisco, P.: About P systems with symport/antiport. In: Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February 2-7, pp. 224–236 (2004)

    Google Scholar 

  12. Greibach, S.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci. 7, 311–324 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York (1966)

    MATH  Google Scholar 

  14. Hopcroft, J., Pansiot, J.J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8(2), 135–159 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  15. Ibarra, O.H.: On Membrane hierarchy in P systems. Theoretical Computer Science 334, 115–129 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  16. Ibarra, O.: On determinism versus nondeterminism in P systems. Theoretical Computer Science (to appear)

    Google Scholar 

  17. Ibarra, O., Yen, H., Dang, Z.: The power of maximal parallelism in P systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 212–224. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Ibarra, O., Wood, S.: On bounded symport/Antiport P systems. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol. 3892, pp. 129–143. Springer, Heidelberg (2006) (to appear)

    Chapter  Google Scholar 

  19. Ibarra, O., Yen, H.: On deterministic catalytic systems. In: Pre-proceedings of 10th International Conference on Implementation and Application of Automata (2005) (to appear)

    Google Scholar 

  20. Ibarra, O., Woodworth, S., Yen, H.-C., Dang, Z.: On sequential and 1-deterministic P systems. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 905–914. Springer, Heidelberg (2005) (to appear)

    Chapter  Google Scholar 

  21. Monien, B.: Two-way multihead automata over a one-letter alphabet. RAIRO Informatique theorique 14(1), 67–82 (1980)

    MATH  MathSciNet  Google Scholar 

  22. Paun, A., Paun, G.: The power of communication: P systems with symport/antiport. New Generation Computers 20(3), 295–306 (2002)

    Article  MATH  Google Scholar 

  23. Paun, G.: Computing with membranes. Turku University Computer Science Research Report No. 208 (1998)

    Google Scholar 

  24. Paun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  25. Paun, G.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  26. Paun, G.: Further twenty six open problems in membrane computing. Written for the Third Brainstorming Week on Membrane Computing, Sevilla, Spain (February 2005), Available at http://psystems.disco.unimib.it

  27. Paun, G., Rozenberg, G.: A guide to membrane computing. Theoretical Computer Science 287(1), 73–100 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  28. Paun, G., Pazos, J., Perez-Jimenez, M.J., Rodriguez-Paton, A.: Symport/antiport P systems with three objects are universal. Fundamenta Informaticae 64, 1–4 (2004)

    MathSciNet  Google Scholar 

  29. Savitch, W.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177–192 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  30. Savitch, W.: A note on multihead automata and context-sensitive languages. Acta Informatica 2, 249–252 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  31. Sosik, P.: P systems versus register machines: two universality proofs. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 371–382. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Gdansk University, Wita Stwosza 57, 80 952, Gdansk, Poland

    Joanna Jȩdrzejowicz  & Andrzej Szepietowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ibarra, O.H. (2005). Some Computational Issues in Membrane Computing. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_4

Download citation

  • DOI: https://doi.org/10.1007/11549345_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28702-5

  • Online ISBN: 978-3-540-31867-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation