Abstract
Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polynomial time. However, we give a P upperbound on an important restriction of such systems. In particular we examine systems with dissolution, elementary division and where each membrane initially has at most one child membrane. Even though such systems may create exponentially many membranes, each with different contents, we show that their power is upperbounded by P.
This work is supported by a Project of Excellence TIC-581 from the Junta de Andalucía, project TIN 2006 13425 of Ministerio de Educación y Ciencia of Spain, and the Irish Research Council for Science, Engineering and Technology.
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
Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Campero, F.J.: Computational efficiency of dissolution rules in membrane systems. International Journal of Computer Mathematics 83(7), 593–611 (2006)
Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Complexity classes in models of cellular computing with membranes. Natural Computing 2(3), 265–285 (2003)
Mauri, G., Pérez-Jiménez, M.J., Zandron, C.: On a Păun’s Conjecture in Membrane Systems. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2007. LNCS, vol. 4527, pp. 180–192. Springer, Heidelberg (2007)
Murphy, N., Woods, D.: The computational complexity of uniformity and semi-uniformity in membrane systems (in preparation)
Murphy, N., Woods, D.: Active membrane systems without charges and using only symmetric elementary division characterise P. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 367–384. Springer, Heidelberg (2007)
Murphy, N., Woods, D.: A characterisation of NL using membrane systems without charges and dissolution. In: Calude, C.S., Costa, J.F., Freund, R., Oswald, M., Rozenberg, G. (eds.) UC 2008. LNCS, vol. 5204, pp. 164–176. Springer, Heidelberg (2008)
Papadimitriou, C.H.: Computational complexity. Addison-Wesley, Reading (1995)
Păun, G.: Further twenty six open problems in membrane computing. In: Proceedings of the Third Brainstorming Week on Membrane Computing, Sevilla, Spain, January 2005, pp. 249–262 (2005)
Păun, G.: P Systems with active membranes: Attacking NP-Complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)
Păun, G.: Membrane Computing. Springer, Berlin (2002)
Sosík, P.: The computational power of cell division in P systems: Beating down parallel computers? Natural Computing 2(3), 287–298 (2003)
Sosík, P., Rodríguez-Patón, A.: Membrane computing and complexity theory: A characterization of PSPACE. Journal of Computer and System Sciences 73(1), 137–152 (2007)
Zandron, C., Ferretti, C., Mauri, G.: Solving NP-complete problems using P systems with active membranes. In: Antoniou, I., Calude, C., Dinneen, M. (eds.) UMC 2000: Proceedings of the Second International Conference on Unconventional models of Computation, London, UK, pp. 289–301. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woods, D., Murphy, N., Pérez-Jiménez, M.J., Riscos-Núñez, A. (2009). Membrane Dissolution and Division in P. In: Calude, C.S., Costa, J.F., Dershowitz, N., Freire, E., Rozenberg, G. (eds) Unconventional Computation. UC 2009. Lecture Notes in Computer Science, vol 5715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03745-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-03745-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03744-3
Online ISBN: 978-3-642-03745-0
eBook Packages: Computer ScienceComputer Science (R0)