%0 Generic
%D 2005
%T Exploring computation trees associated with P systems
%A Andrés Cordón-Franco
%A Miguel A. Gutiérrez-Naranjo
%A Mario J. Pérez-Jiménez
%A Agustín Riscos-Núñez
%C Amsterdam, The Netherlands
%I Springer
%P 278-286
%U http://www.springerlink.com/content/tv941vghkntuv8rb/?p=aec382c195614ca0a11739e4c1e790d8&pi=15
%V 3365
%X 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.
%@ 978-3-540-25080-7