Exploring computation trees associated with p systems

Authors:
Andrés Cordón-Franco;Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez;Agustín Riscos-Núñez
Affiliations:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain
Venue:
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Year:
2004

Citing 2
Cited 4

Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction

Gabor wavelets and General Discriminant Analysis for face identification and verification

Image and Vision Computing
Efficient computation in rational-valued p systems

Mathematical Structures in Computer Science
Communication membrane systems with active symports

Journal of Automata, Languages and Combinatorics
Searching previous configurations in membrane computing

WMC'09 Proceedings of the 10th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

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.