Advertisement

Trading Polarization for Bi-stable Catalysts in P Systems with Active Membranes

  • Mario J. Pérez-Jiménez
  • Francisco José Romero-Campero
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3365)

Abstract

In the last time, several efforts have been made in order to remove polarizations of membranes from P systems with active membranes; the present paper is a contribution in this respect. In order to compensate the loss of power represented by avoiding polarizations, we use bi-stable catalysts. Polarizationless systems with active membranes which use bi-stable catalysts are proven to be computationally complete and able to solve efficiently NP-complete problems. In this paper we present a solution to SAT in linear time. In order to illustrate the presented solution, we also provide a simulation with CLIPS.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally universal P systems without priorities: Two catalysts suffice. Theoretical Computer Sci. (to appear)Google Scholar
  2. 2.
    Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  3. 3.
    Păun, G.: Computing with membranes. Journal of computer and Systems Sciences 61(1), 108–143 (2000)zbMATHCrossRefGoogle Scholar
  4. 4.
    Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A.: P systems with tables of rules. In: Păun, G., RiscosNúñez, A., Romero-Jiménez, A., Sancho-Caparrini, F. (eds.) Proceedings of the Second Brainstorming Week on Membrane Computing, Report RGNC 01/04, pp. 366–380 (2004)Google Scholar
  5. 5.
    Păun, G., Yu, S.: On synchronization in P systems. Fundamenta Informaticae 38(4), 397–410 (1999)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Teoría de la Complejidad en modelos de computacion celular con membranas. Ed. Kronos, Sevilla (2002)Google Scholar
  7. 7.
    Pérez-Jiménez, M.J., Riscos-Núñez, A.: Solving the Subset-Sum problem by active membranes. New Generation Computing (in press)Google Scholar
  8. 8.
    Pérez-Jiménez, M.J., Riscos-Núñez, A.: A linear-time solution for the Knapsack problem using active membranes. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 140–152. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Pérez-Jiménez, M.J., Romero-Campero, F.J.: A CLIPS simulator for 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, pp. 387–413 (2004)Google Scholar
  10. 10.
    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., Vaszyl, G. (eds.) Proceedings of the Fifth International Workshop on Descriptional Complexity of Formal Systems, pp. 284–294 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Mario J. Pérez-Jiménez
    • 1
  • Francisco José Romero-Campero
    • 1
  1. 1.Research Group on Natural Computing, Department of Computer Science and Artificial IntelligenceUniversity of SevillaSevillaSpain

Personalised recommendations