Tissue P Systems with Cell Division
AbstractIn tissue P systems several cells (elementary membranes) communicate through symport/antiport rules, thus carrying out a computation. We add to such systems the basic feature of (cell–like) P systems with active membranes – the possibility to divide cells. As expected (as it is the case for P systems with active membranes), in this way we get the possibility to solve computationally hard problems in polynomial time; we illustrate this possibility with SAT problem.
 D. Díaz–Pernil, M.A. Gutiérrez–Naranjo, M.J. Pérez–Jiménez, A. Riscos–Nú-ez: Solving subset sum in linear time by using tissue P systems with cell division. In J. Mira, J.R. Alvarez, eds. Bio- Inspired Modeling of Cognitive Tasks, Second International Work–Conference on the Interplay between Natural and Artificial Computation, IWINAC 2007, La Manga del Mar Menor, Spain, June 2007,Part I, LNCS 4527, Springer, 2007, 170–179.
 D. Díaz–Pernil, M.A. Gutiérrez–Naranjo, M.J. Pérez–Jiménez, A. Riscos–Nú-ez: Solving the partition problem by using tissue-like P systems with cell division. In D. Díaz, C. Graciani, M.A. Gutiérrez, Gh. P˘aun, I. Pérez–Hurtado, A. Riscos, eds., Proceedings of the Sixth Brainstorming Week on Membrane Computing, Report RGNC 01/08, Fénix Editora, 2008, 123–134.
 D. Díaz–Pernil, M.A. Gutiérrez–Naranjo, M.J. Pérez–Jiménez, A. Riscos–Nú-ez: A linear-time tissue P system based solution for the 3-coloring problem, Electronic Notes in Theoretical Computer Science, 171 (2007), 81–93.
 D. Díaz–Pernil, M.J. Pérez–Jiménez, A. Riscos–Nú-ez, A. Romero–Jiménez: Computational efficiency of cellular division in tissue-like membrane systems, submitted, 2008.
 P. Frisco, H.J. Hoogeboom: Simulating counter automata by P systems with symport/antiport. In Gh. Paun, G. Rozenberg, A. Salomaa, C. Zandron, eds., Membrane Computing. International Workshop WMC 2002, Curtea de Arge¸s, Romania, Revised Papers, LNCS 2597, Springer, 2003, 288–301.
 M.A. Gutiérrez–Naranjo, M.J. Pérez–Jiménez, F.J. Romero–Campero: A linear time solution for QSAT with membrane creation. In R. Freund, Gh. P˘aun, G. Rozenberg, A. Salomaa, eds., Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers, LNCS 3850, Springer, 2006, 241–252.
 Gh. P˘aun: Computing with Membranes: An Introduction, Springer, Berlin, 2002.
 M.J. Pérez–Jiménez: An approach to computational complexity in membrane computing. In G. Mauri, Gh. P˘aun, M.J. Pérez-Jiménez, G. Rozenberg, A. Salomaa, eds., Membrane Computing, 5th International Workshop, WMC5, Revised Selected and Invited Papers, LNCS 3365, Springer, 2005, 85–109.
 M. Pérez–Jiménez, A. Romero–Jiménez, F. Sancho–Caparrini, Teoría de la Complejidad en Modelos de Computatión Celular con Membranas, Editorial Kronos, Sevilla, 2002.
 P. Sosik, A. Rodríguez-Patón: Membrane computing and complexity theory: A characterization of PSPACE, International Journal of Foundations of Computer Science, 73, 1 (2007), 137–152.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.