Abstract
P systems are a computational model inspired by the functioning of the cell and based upon the notion of cellular membrane. We show how different features of P systems with active membranes, a variant of the basic model where membranes can be multiplied by division, can be used to approach various problems in computation theory.
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., Leporati, A., Mauri, G., Porreca, A.E., Zandron, C.: The computational power of exponential-space P systems with active membranes. In: Martínez-del-Amor, et al. (eds). Proc. of BWMC 2010, vol. I, pp. 35–60. Fénix Editora (2012)
Alhazov, A., Martin-Vide, C., Pan, L.: Solving a PSPACE–complete problem by P–systems with restricted active membranes. Fund. Inf. 58(2), 67–77 (2003)
Csuhaj-Varju, E., Oswald, M., Vaszil, G.: P automata, Handbook of Membrane Computing. In: Paun, G., et al. (eds.), pp. 144–167. Oxford University Press (2010)
Gutiérrez-Naranjo, M.A., Jesús Pérez-Jímenez, M., Riscos-Núñez, A., Romero-Campero, F.J.: P–systems with active membranes, without polarizations and without dissolution: a characterization of P. In: Calude, C.S., Dinneen, M.J., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G. (eds.) UC 2005. LNCS, vol. 3699, pp. 105–116. Springer, Heidelberg (2005)
Gutierrez-Naranjo, M., Perez-Jimenez, M.J., Riscos-Nunez, A., Romero-Campero, F.J.: Characterizing tractability by cell-like membrane systems. In: Subramanian, K.G., et al. (eds.) Formal Models, Languages and Applications, Ser. Mach. Percept. Artif. Intell., vol. 66, pp. 137–154. World Scientific (2006)
Krishna, S.N., Rama, R.: A variant of P-systems with active membranes: Solving NP-complete problems. Rom. J. of Inf. Sci. and Tech. 2, 4 (1999)
Leporati, A., Zandron, C., Gutierrez-Naranjo, M.A.: P systems with input in binary form. Int. J. of Found. of Comp. Sci. 17(1), 127–146 (2006)
Leporati, A., Mauri, G., Zandron, C.: Quantum Sequential P Systems with Unit Rules and Energy Assigned to Membranes. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 310–325. Springer, Heidelberg (2006)
Mix Barrington, D.A., Immerman, N., Straubing, H.: On uniformity within \(\textrm{NC}^1\). Journal of Computer and System Sciences 41(3), 274–306 (1990)
Murphy, N., Woods, D.: The computational power of membrane systems under tight uniformity conditions. Natural Computing 10(1), 613–632 (2011)
Păun, G.: Computing with membranes. J. of Computer and System Sciences 61(1), 108–143 (2000)
Păun, G.: P systems with active membranes: Attacking NP-complete problems. J. of Automata, Languages and Combinatorics 6(1), 75–90 (2001)
Păunm, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Păun, G., Rozenberg, G., Salomaa, A. (eds.): Handbook of Membrane Computing. Oxford University Press (2010)
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Introducing a space complexity measure for P systems. Int. J. of Comp., Comm. & Control 4(3), 301–310 (2009)
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: P systems with Elementary Active Membranes: Beyond NP and coNP. In: Gheorghe, M., Hinze, T., Păun, G., Rozenberg, G., Salomaa, A. (eds.) CMC 2010. LNCS, vol. 6501, pp. 338–347. Springer, Heidelberg (2010)
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: P Systems with Active Membranes: Trading Time for Space. Natural Computing 10(1), 167–182 (2011)
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: P systems with active membranes working in polynomial space. Int. J. Found. Comp. Sc. 22(1), 65–73 (2011)
Porreca, A.E., Mauri, G., Zandron, C.: Complexity classes for membrane systems. RAIRO-Theor. Inform. and Applic. 40(2), 141–162 (2006)
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Sublinear-Space P Systems with Active Membranes. In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, G. (eds.) CMC 2012. LNCS, vol. 7762, pp. 342–357. Springer, Heidelberg (2013)
Sosik, P.: The computational power of cell division in P systems: Beating down parallel computers? Natural Computing 2(3), 287–298 (2003)
Zandron, C., Ferretti, C., Mauri, G.: Solving NP-complete problems using P systems with active membranes. In: Antoniou, I., Calude, C.S., Dinneen, M.J. (eds.) Unconventional Models of Computation, pp. 289–301. Springer, London (2000)
Zandron, C., Ferretti, C., Mauri, G.: Two Normal Forms for Rewriting P systems, in Machines. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 153–164. Springer, Heidelberg (2001)
Zandron, C., Leporati, A., Ferretti, C., Mauri, G., Pérez-Jiménez, M.J.: On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution. Fundamenta Informaticae 87(1), 79–91 (2008)
The P systems Web page, http://ppage.psystems.eu/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zandron, C. (2014). Exploiting Membrane Features to Compute. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham. https://doi.org/10.1007/978-3-319-08019-2_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-08019-2_41
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08018-5
Online ISBN: 978-3-319-08019-2
eBook Packages: Computer ScienceComputer Science (R0)