Exploring computation trees associated with P systems

Thu, 11/29/2007 - 14:41 — ana

Title	Exploring computation trees associated with P systems
Publication Type	Journal Papers
Year of Publication	2005
Authors	Cordón-Franco, A., Gutiérrez-Naranjo M. A., Pérez-Jiménez M. J., & Riscos-Núñez A.
Journal Title	Lecture Notes in Computer Science
ISBN Number	978-3-540-25080-7
Publisher	Springer
Place Published	Amsterdam, The Netherlands
Volume	3365
Pages	278-286
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.
URL	http://www.springerlink.com/content/tv941vghkntuv8rb/?p=aec382c195614ca0a11739e4c1e790d8&pi=15
ISSN Number	0302-9743