JUCS - Journal of Universal Computer Science 10(5): 559-566, doi: 10.3217/jucs-010-05-0559
A Note on Complexity Measures for Probabilistic P Systems
expand article infoAndrés Cordón-Franco‡, Fernando Sancho-Caparrini‡
‡ University of Sevilla, Sevilla, Spain

Corresponding author: Andrés Cordón-Franco ( acordon@us.es )

© Andrés Cordón-Franco, Fernando Sancho-Caparrini.
This article is freely available under the J.UCS Open Content License.
Citation: Cordón-Franco A, Sancho-Caparrini F (2004) A Note on Complexity Measures for Probabilistic P Systems. JUCS - Journal of Universal Computer Science 10(5): 559-566. https://doi.org/10.3217/jucs-010-05-0559
Open Access
Abstract
In this paper we present a first approach to the definition of different entropy measures for probabilistic P systems in order to obtain some quantitative parameters showing how complex the evolution of a P system is. To this end, we define two possible measures, the first one to reflect the entropy of the P system considered as the state space of possible computations, and the second one to reflect the change of the P system as it evolves.
Keywords
P systems, Entropy, Natural Computing