%0 Generic
%D 2004
%T A Note on Complexity Measures for Probabilistic P Systems
%A Andrés Cordón-Franco
%A Fernando Sancho-Caparrini
%C Granz Austria
%K Entropy
%K Natural computing
%K P systems
%N 5
%P 559-566
%U http://www.jucs.org/jucs_10_5/a_note_on_complexity
%V 10
%X 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.
%> https://www.gcn.us.es/files/A note on Complexity Measures....pdf