Abstract
P systems with active membranes are a variant of P systems where membranes play an active role during the computation, for example by dividing existing membranes in order to create new ones. In this way, an exponential number of membranes can be obtained in polynomial time, and then used in parallel to attack computationally hard problems. Many interesting questions arise concerning the trade-off between time and space needed to solve various classes of computational problems by means of such membrane systems. In this paper we overview the main results presented in the literature concerning this subject.
Similar content being viewed by others
References
Păun, G.: P systems with active membranes: Attacking NP-complete problems. J. Autom. Lang. Comb. 6(1), 75–90 (2001)
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.) Proceedings of the Second International Conference on Unconventional Models of Computation, UMC’2K, pp. 289–301. Springer, New York (2001)
Krishna, S.N., Rama, R.: A variant of P systems with active membranes: solving NP-complete problems. Romanian J. Inf. Sci. Technol. 2(4), 357–367 (1999)
Porreca, A.E., Mauri, G., Zandron, C.: Non-confluence in divisionless P systems with active membranes. Theoret. Comput. Sci. 411(6), 878–887 (2010)
Sosik, P., Rodriguez-Paton, A.: Membrane computing and complexity theory: a characterization of PSPACE. J. Comput. Syst. Sci. 73, 137–152 (2007)
Leporati, A., Manzoni, L., Mauri, G., Porreca, A.E., Zandron, C.: Simulating elementary active membranes with an application to the P conjecture. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Sosík, P., Zandron, C. (eds.) CMC 2014, LNCS 8961, pp. 284–299. Springer, Heidelberg (2014)
Leporati, A., Manzoni, L., Mauri, G., Porreca, A.E., Zandron, C.: Membrane division, oracles, and the counting hierarchy. Fundam. Inf. 138(1–2), 97–111 (2015)
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: P systems simulating oracle computations. In: Gheorghe, M., Păun, Gh, Salomaa, A., Rozenberg, G., Verlan, S. (eds.) 12th International Conference on Membrane Computing, CMC 2011. Lecture Notes in Computer Science, vol. 7184, pp. 346–358. Springer, New York (2012)
Zandron, C., Leporati, A., Ferretti, C., Mauri, G., Perez-Jimenez, M.J.: On the computational efficiency of polarizationless recognizer P systems with strong division and dissolution. Fundam. Inf. 87(1), 79–91 (2008)
Porreca, A.E., Mauri, G., Zandron, C.: Complexity classes for membrane systems. RAIRO-Theor. Inf. Appl. 40(2), 141–162 (2006)
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Introducing a space complexity measure for P systems. Int. J. Comput. Commun. Control 4(3), 301–310 (2009)
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: P systems with active membranes: trading time for space. Nat. Comput. 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. Comput. Sci. 22(1), 65–73 (2011)
Alhazov, A., Leporati, A., Mauri, G., Porreca, A.E., Zandron, C.: Space complexity equivalence of P systems with active membranes and Turing machines. Theor. Comput. Sci. 529, 69–81 (2014)
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Sublinear space P systems with active membranes. In: Membrane Computing: 13th International Conference, CMC: LNCS 7762, vol. 2013, pp. 342–357. Springer, Berlin (2012)
Leporati, A., Mauri, G., Porreca, A.E., Zandron, C.: A gap in the space hierarchy of P systems with active membranes. J. Autom. Lang. Comb. 19(1–4), 173–184 (2014)
Leporati, A., Manzoni, L., Mauri, G., Porreca, A.E., Zandron, C.: Constant-space P systems with active membranes. Fundam. Inf. Fundam. Inf. 134(1–2), 111–128 (2014)
Păun, Gh, Rozenberg, G., Salomaa, A. (eds.): Handbook of Membrane Computing. Oxford University Press, Oxford (2010)
Gheorghe, M., Păun, Gh, Perez-Jimenez, M.J., Rozenberg, G.: Frontiers of membrane computing: open problems and research topics. Intern. J. Found. Comput. Sci. 24(5), 171–250 (2013)
Csuhaj-Varju, E., Oswald, M., Vaszil, Gy.: P automata, handbook of membrane computing. In: Paun, Gh., et al. (eds.), pp. 144–167. Oxford University Press, Oxford (2010)
Murphy, N., Woods, D.: The computational power of membrane systems under tight uniformity conditions. Nat. Comput. 10(1), 613–632 (2011)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1993)
Mix Barrington, D.A., Immerman, N., Straubing, H.: On uniformity within \({\rm NC}^1\). J. Comput. Syst. Sci. 41(3), 274–306 (1990)
Leporati, A., Manzoni, L., Mauri, G., Porreca, A.E., Zandron, C.: Trading geometric realism for efficiency in tissue P systems. Romanian J. Inf. Sci. Technol. 19(1–2), 17–30 (2016)
Leporati, A., Manzoni, L., Mauri, G., Porreca, A.E., Zandron, C.: Tissue P systems with small cell volume. Fundam. Inf. 154(1–4), 261–275 (2017)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Leporati, A., Manzoni, L., Mauri, G. et al. A survey on space complexity of P systems with active membranes. Int J Adv Eng Sci Appl Math 10, 221–229 (2018). https://doi.org/10.1007/s12572-018-0227-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12572-018-0227-8