In this paper we address the problem of describing the complexity of the evolution of a tissue-like P system with cell division. In the computations of such systems the number of (parallel) steps is not sufficient to evaluate the complexity. Following this consideration, Sevilla Carpets were introduced as a tool to describe the space-time complexity of P systems. Sevilla Carpets have already been used to compare two different solutions of the Subset Sum problem (both designed in the framework of P systems with active membranes) running on the same instance. In this paper we extend the comparison to the framework of tissue-like P systems with cell division. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Díaz-Pernil, D., Gallego-Ortiz, P., Gutiérrez-Naranjo, M. A., Pérez-Jiménez, M. J., & Riscos-Núñez, A. (2009). Descriptional complexity of tissue-like P systems with cell division. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5715 LNCS, pp. 168–178). https://doi.org/10.1007/978-3-642-03745-0_21
Mendeley helps you to discover research relevant for your work.