Advertisement

Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode

  • Rudolf Freund
  • Gheorghe Păun
  • Mario J. Pérez-Jiménez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4618)

Abstract

We investigate the computing power and the efficiency of P systems with active membranes without polarizations, working in the minimally parallel mode. Such systems are shown to be computationally complete even when using only rules handling single objects in the membranes and avoiding the division of non-elementary membranes. Moreover, we elaborate an algorithm for solving NP-complete problems, yet in this case we need evolution rules generating at least two objects as well as rules for non-elementary membrane division.

Keywords

Active Membrane Parallel Mode Truth Assignment Skin Region Evolution Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alhazov, A.: P systems without multiplicities of symbol-objects. Information Processing Letters 100, 124–129 (2006)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Alhazov, A., Pérez-Jiménez, M.J.: Uniform Solution to QSAT Using Polarizationless Active Membranes. In: Vol. I of Proc. of the Fourth Brainstorming Week on Membrane Computing, Sevilla (Spain), pp. 29–40 (January 30 - February 3, 2006)Google Scholar
  3. 3.
    Alhazov, A., Freund, R.: Membrane Computing, International Workshop, WMC5, Milano, Italy, 2004, Selected Papers. In: Mauri, G., Păun, G., Pérez-Jiménez, M.J., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 81–94. Springer, Heidelberg (2005)Google Scholar
  4. 4.
    Alhazov, A., Freund, R., Păun, Gh.: Computational completeness of P systems with active membranes and two polarizations. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 82–92. Springer, Heidelberg (2005)Google Scholar
  5. 5.
    Ciobanu, G., Pan, L., Păun, Gh., Pérez-Jiménez, M.J.: P systems with minimal parallelism. Theoretical Computer Science (to appear)Google Scholar
  6. 6.
    Freund, R., Verlan, S.: A formal framework for P systems. In: Proceedings WMC 8, (to appear, 2007)Google Scholar
  7. 7.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)zbMATHGoogle Scholar
  8. 8.
    Minsky, M.: Computation – Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)zbMATHGoogle Scholar
  9. 9.
    Păun, Gh.: P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)zbMATHMathSciNetGoogle Scholar
  10. 10.
    Păun, Gh.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Rudolf Freund
    • 1
  • Gheorghe Păun
    • 2
  • Mario J. Pérez-Jiménez
    • 3
  1. 1.Institute of Computer Languages, Vienna University of Technology, Favoritenstr. 9, WienAustria
  2. 2.Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700 Bucureşti, Romania, and, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012 SevillaSpain
  3. 3.Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012 SevillaSpain

Personalised recommendations