Searching previous configurations in membrane computing

Authors:
Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez
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
Venue:
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Year:
2009

Citing 4
Cited 1

Membrane Computing: An Introduction

Membrane Computing: An Introduction
Dual P Systems

Membrane Computing
On the power of dissolution in p systems with active membranes

WMC'05 Proceedings of the 6th international conference on Membrane Computing
Exploring computation trees associated with p systems

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Matrix representation of spiking neural P systems

CMC'10 Proceedings of the 11th international conference on Membrane computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Searching all the configurations C′ which produce a given configuration C is an extremely hard task. The current approximations are based on heavy hand-made calculus by considering the specific features of the given configuration. In this paper we present a general method for characterizing all the configurations C′ which produce a given configuration C in the framework of transition P systems without cooperation and without dissolution.