A Note on Complexity Measures for Probabilistic P Systems

dc.creatorCordón-Franco,Andrés
dc.creatorSancho-Caparrini,Fernando
dc.date2004
dc.date.accessioned2024-02-06T12:52:57Z
dc.date.available2024-02-06T12:52:57Z
dc.descriptionIn 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.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-010-05-0559
dc.identifierhttps://lib.jucs.org/article/28230/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8546
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 10(5): 559-566
dc.subjectP systems
dc.subjectEntropy
dc.subjectNatural Computing
dc.titleA Note on Complexity Measures for Probabilistic P Systems
dc.typeResearch Article
Файлы