Self-activating P Systems

  • Eugen Czeizler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2597)


Until now, the solving of NP complete problems in polynomial time in the framework of P systems was accomplished by the use of three different techniques: the duplication of membranes, the creation of membranes, and the replication of strings. In this paper we introduce a new type of P systems which comes with a new technique of approaching this class of problems. In the initial configuration of these P systems we have an arbitrarily large number of unactivated base-membranes, which, in a polynomial time, are activated in an exponential number. Using these type of systems we solve the SAT problem in a linear time, with respect to the number of variables and clauses.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Castellanos, A. Rodriguez-Paton, Gh. Păun, Computing with membranes: P systems with worm-objects, IEEE 7th. Intern. Conf. on String Processing and Information Retrieval, SPIRE 200, La Coruna, Spain, 64–74.Google Scholar
  2. 2.
    R. Freund, C. Martin-Vide, Gh. Păun, Computing with membranes: Three more collapsing hierarchies, submitted 2000.Google Scholar
  3. 3.
    S. N. Krishna, R. Rama, P systems with replicated rewriting, Journal of Automata, Languages and Combinatorics, 6, 3 (2001), 345–350.MathSciNetMATHGoogle Scholar
  4. 4.
    C. Martin-Vide, Gh. Păun, A. Rodriguez-Paton, On P systems with membrane creation, Computer Science Journal of Moldova, 9, 2 (2001), 134–145.MathSciNetMATHGoogle Scholar
  5. 5.
    A. Păun, On P systems with membrane division, in vol. Unconventional Models of Computation (I. Antoniou, C. S. Calude, M. J. Dinneen, eds.), Springer-Verlag, London, 2000, 187–201.Google Scholar
  6. 6.
    Gh. Păun, Computing with membranes, Journal of Computer and System Science, 61, 1 (2000), 108–143.MATHCrossRefGoogle Scholar
  7. 7.
    Gh. Păun, P systems with active membranes: Attacking NP complete problems, Journal of Automata, Languages and Combinatorics, 6, 1 (2001), 75–90.MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Eugen Czeizler
    • 1
  1. 1.Turku Centre for Computer Science and Department of MathematicsUniversity of TurkuTurku FINFinland

Personalised recommendations