Capítulo de Libro
Exploring Computation Trees Associated with P Systems
Autor/es | Cordón Franco, Andrés
Gutiérrez Naranjo, Miguel Ángel Pérez Jiménez, Mario de Jesús Riscos Núñez, Agustín |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2005 |
Fecha de depósito | 2017-01-13 |
Publicado en |
|
ISBN/ISSN | 978-3-540-25080-7 0302-9743 |
Resumen | Usually, the evolution of a P system generates a computation
tree too large to be efficiently handled with present–day computers;
moreover, different branches in this tree may differ significantly from a
computational ... Usually, the evolution of a P system generates a computation tree too large to be efficiently handled with present–day computers; moreover, different branches in this tree may differ significantly from a computational complexity point of view, that is, for the amount of time and storage necessary to reach a result. In this paper we propose a first approach to outline a strategy for selecting a suitable branch, in some sense, of the computation tree associated with a P system. To this end, we introduce the key notion of the dependency graph of a P system. |
Agencias financiadoras | Ministerio de Ciencia y Tecnología (MCYT). España |
Identificador del proyecto | TIC2002-04220-C03-01 |
Cita | Cordón Franco, A., Gutiérrez Naranjo, M.Á.,...,Riscos Núñez, A. (2005). Exploring Computation Trees Associated with P Systems. En Membrane Computing, 5th International Workshop, WMC5, Revised Selected and Invited Papers. Lecture Notes in Computer Science, 3365 (2005) (pp. 278-286). Berlin: Springer. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
chp%3A10.1007%2F978-3-540-3183 ... | 180.4Kb | [PDF] | Ver/ | |