<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mónica Cardona</style></author><author><style face="normal" font="default" size="100%">M. Angels Colomer</style></author><author><style face="normal" font="default" size="100%">Agustín Riscos-Núñez</style></author><author><style face="normal" font="default" size="100%">Miquel Rius-Font</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">P Systems: Computing the Period of Irreducible Markov Chains</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Computers, Communications and Control</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Markov chain</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">P systems</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">30/2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.journal.univagora.ro/?page=article_details&id=374</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Agora University Editing House - CCC Publications</style></publisher><pub-location><style face="normal" font="default" size="100%">Oradea, Romania</style></pub-location><volume><style face="normal" font="default" size="100%">4</style></volume><pages><style face="normal" font="default" size="100%">291-300</style></pages><abstract><style face="normal" font="default" size="100%">It is well known that any irreducible and aperiodic Markov chain has exactly one stationary distribution, and for any arbitrary initial distribution, the sequence of distributions at time n converges to the stationary distribution, that is, the
Markov chain is approaching equilibrium as n tends to infinity.
In this paper, a characterization of the aperiodicity in existential terms of some state is
given. At the same time, a Psystem with external output is associated with any irreducible Markov chain. The designed system provides the aperiodicity of that Markov chain and spends a polynomial amount of resources with respect to the size of the input. A comparative analysis with respect to another known solution is described.</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue><custom1><style face="normal" font="default" size="100%">0.373</style></custom1><custom2><style face="normal" font="default" size="100%">50/59 - Q4</style></custom2></record></records></xml>