Repositorio de producción científica de la Universidad de Sevilla

Exploring Computation Trees Associated with P Systems

 

Advanced Search
 
Opened Access Exploring Computation Trees Associated with P Systems
Cites

Show item statistics
Icon
Export to
Author: Cordón Franco, Andrés
Gutiérrez Naranjo, Miguel Ángel
Pérez Jiménez, Mario de Jesús
Riscos Núñez, Agustín
Department: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Date: 2005
Published in: Membrane Computing, 5th International Workshop, WMC5, Revised Selected and Invited Papers. Lecture Notes in Computer Science, 3365 (2005)
ISBN/ISSN: 978-3-540-25080-7
0302-9743
Document type: Chapter of Book
Abstract: 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.
Size: 180.4Kb
Format: PDF

URI: http://hdl.handle.net/11441/52261

DOI: 10.1007/978-3-540-31837-8_16

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)