Abstract
We continue the study of P systems with mobile membranes introduced in [7], which is a variant of P systems with active membranes, but having none of the features like polarizations, label change and division of non-elementary membranes. This variant was shown to be computationally universal (RE) using only the simple operations of endocytosis and exocytosis; moreover, if elementary membrane division is allowed, it is capable of solving NP-complete problems. It was shown in [5] that 4 membranes are sufficient for universality while using only endo/exo operations. In this paper, we study the computational power of these systems more systematically: we examine not only the power due to the number of membranes, but also with respect to the kind of rules used, thereby trying to find out the border line between universality and non-universality. We show that 3 membranes are sufficient for computational universality, whereas two membranes are not, if λ-free rules are used.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alhazov, A., Ishdorj, T.O.: Membrane operations in P systems with active membranes. In: Proc. Second BWMC, TR 01/04, Sevilla University, pp. 37–44 (2004)
Bel Enguix, G., Jiménez-Lopez, M.D.: Linguistic membrane systems and applications. In: Applications of Membrane Computing, pp. 347–388. Springer, Heidelberg (2005)
Besozzi, D., Zandron, C., Mauri, G., Sabadini, N.: P systems with gemmation of mobile membranes. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 136–153. Springer, Heidelberg (2001)
Csuhaj-Varjú, E., Di Nola, A., Păun, Gh., Peŕez-Jiménez, M.J. , Vaszil, G.: Editing configurations of P systems. In: Proc. 3rd BWMC, January 31- February 4, 2005, pp. 131–154 (2005)
Krishna, S.N.: The Power of Mobility: Four Membranes Suffice. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 242–251. Springer, Heidelberg (2005)
Krishna, S.N.: Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes, Technical Report, IIT Bombay (2006), www.cse.iitb.ac.in/~krishnas/cie06tr.ps
Krishna, S.N., Păun, Gh.: P systems with mobile membranes. Natural Computing 4(3), 255–274 (2005)
Freund, R., Oswald, M.: GP Systems with Forbidding Context. Fundamenta Informaticae 49(1–3), 81–102 (2002)
Freund, R., Oswald, M.: P systems with activated/prohibited membrane channels. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 261–269. Springer, Heidelberg (2003)
Lambek, J.: How to program an infinite abacus. Canad. Math. Bull. 4, 295–302 (1961)
Minsky, M.L.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)
Păun, Gh.: P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)
Păun, Gh.: Computing with Membranes. An Introduction. Springer, Heidelberg (2002)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishna, S.N. (2006). Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_53
Download citation
DOI: https://doi.org/10.1007/11780342_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35466-6
Online ISBN: 978-3-540-35468-0
eBook Packages: Computer ScienceComputer Science (R0)