A Note on Complexity Measures for Probabilistic P Systems
暂无分享,去创建一个
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.
[1] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[2] Gheorghe Păun,et al. (In search of) probabilistic P systems. , 2003, Bio Systems.
[3] Gheorghe Paun,et al. Computing with Membranes , 2000, J. Comput. Syst. Sci..
[4] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[5] Alexander Backlund. The definition of system , 2000 .