Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
R. Freund, C. Martin-Vide, Gh. Păun, Computing with membranes: Three more collapsing hierarchies, submitted 2000.
S. N. Krishna, R. Rama, P systems with replicated rewriting, Journal of Automata, Languages and Combinatorics, 6, 3 (2001), 345–350.
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.
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.
Gh. Păun, Computing with membranes, Journal of Computer and System Science, 61, 1 (2000), 108–143.
Gh. Păun, P systems with active membranes: Attacking NP complete problems, Journal of Automata, Languages and Combinatorics, 6, 1 (2001), 75–90.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czeizler, E. (2003). Self-activating P Systems. In: PĂun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36490-0_15
Download citation
DOI: https://doi.org/10.1007/3-540-36490-0_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00611-4
Online ISBN: 978-3-540-36490-0
eBook Packages: Springer Book Archive