Membrane Dissolution and Division in P
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.
KeywordsPolynomial Time Sink Node Membrane System Dependency Graph Simulation Algorithm
Unable to display preview. Download preview PDF.
- 4.Murphy, N., Woods, D.: The computational complexity of uniformity and semi-uniformity in membrane systems (in preparation)Google Scholar
- 6.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)Google Scholar
- 8.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)Google Scholar
- 13.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)Google Scholar