Skip to main content

On the Power of Dissolution in P Systems with Active Membranes

  • Conference paper
Book cover Membrane Computing (WMC 2005)

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

Included in the following conference series:

Abstract

In this paper we study membrane dissolution rules in the framework of P systems with active membranes but without using electrical charges. More precisely, we prove that the polynomial computational complexity class associated with the class of recognizer P systems with active membranes, without polarizations and without dissolution coincides with the standard complexity class P. Furthermore, we demonstrate that if we consider dissolution rules, then the resulting complexity class contains the class NP.

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., Freund, R., Păun, G.: P systems with active membranes and two polarizations. In: Păun, G., Riscos-Núñez, A., Romero-Jiménez, A., Sancho-Caparrini, F. (eds.) Proceedings of the Second Brainstorming Week on Membrane Computing, Report RGNC 01/04, pp. 20–35 (2004)

    Google Scholar 

  2. Alhazov, A., Pan, L., Păun, G.: Trading polarizations for labels in P systems with active membranes. Acta Informaticae 41(2-3), 111–144 (2004)

    Article  MATH  Google Scholar 

  3. Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A.: A fast P system for finding a balanced 2-partition. Soft Computing 9(9), 673–678 (2005)

    Article  MATH  Google Scholar 

  4. Krishna, S.N., Rama, R.: A variant of P systems with active membranes: Solving NP–complete problems. Romanian Journal of Information Science and Technology 2(4), 357–367 (1999)

    Google Scholar 

  5. Obtulowicz, A.: Deterministic P systems for solving SAT problem. Romanian Journal of Information Science and Technology 4(1–2), 551–558 (2001)

    MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  7. Păun, G.: Computing with membranes: Attacking NP–complete problems. In: Antoniou, I., Calude, C., Dinneen, M.J. (eds.) Unconventional Models of Computation, UMC 2K, pp. 94–115. Springer, Heidelberg (2000)

    Google Scholar 

  8. Pérez–Jiménez, M.J.: An approach to computational complexity in Membrane Computing. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 85–109. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Pérez-Jiménez, M.J., Riscos-Núñez, A.: Solving the Subset-Sum problem by active membranes. New Generation Computing 23(4), 367–384 (2005)

    Google Scholar 

  10. Pérez-Jiménez, M.J., Riscos-Núñez, A.: A linear–time solution to the Knapsack problem using P systems with active membranes. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 250–268. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Pérez-Jiménez, M.J., Romero-Campero, F.J.: Solving the Bin Packing problem by recognizer P systems with active membranes. In: Păun, G., Riscos-Núñez, A., Romero-Jiménez, A., Sancho-Caparrini, F. (eds.) Proceedings of the Second Brainstorming Week on Membrane Computing, Report RGNC 01/04, University of Seville, pp. 414–430 (2004)

    Google Scholar 

  12. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: A polynomial complexity class in P systems using membrane division. In: Csuhaj-Varjú, E., Kintala, C., Wotschke, D., Vaszil, G. (eds.) Proceedings of the 5th Workshop on Descriptional Complexity of Formal Systems, DCFS 2003, pp. 284–294 (2003)

    Google Scholar 

  13. Pérez-Jiménez, M.J., Romero-Campero, F.J.: Attacking the Common Algorithmic Problem by recognizer P systems. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 304–315. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Zandron, C., Ferreti, C., Mauri, G.: Solving NP-complete problems using P systems with active membranes. In: Antoniou, I., Calude, C., Dinneen, M.J. (eds.) Unconventional Models of Computation, UMC 2K, pp. 289–301. Springer, Heidelberg (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gutiérrez–Naranjo, M.A., Pérez–Jiménez, M.J., Riscos–Núñez, A., Romero–Campero, F.J. (2006). On the Power of Dissolution in P Systems with Active Membranes. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2005. Lecture Notes in Computer Science, vol 3850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603047_16

Download citation

  • DOI: https://doi.org/10.1007/11603047_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30948-2

  • Online ISBN: 978-3-540-32340-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics