Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Volume 10 / Issue 5

available in:   PDF (105 kB) PS (51 kB)
 
get:  
Similar Docs BibTeX   Write a comment
  
get:  
Links into Future
 
DOI:   10.3217/jucs-010-05-0559

 

A Note on Complexity Measures for Probabilistic P Systems

Andrés Cordón-Franco (University of Sevilla, Spain)

Fernando Sancho-Caparrini (University of Sevilla, Spain)

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: Entropy, Natural Computing, P systems

Categories: F.1.1, G.2.2, H.1.1