%0 Generic
%D 2009
%T P Systems: Computing the Period of Irreducible Markov Chains
%A Mónica Cardona
%A M. Angels Colomer
%A Agustín Riscos-Núñez
%A Miquel Rius-Font
%C Oradea, Romania
%I Agora University Editing House - CCC Publications
%K Markov chain
%K Membrane computing
%K P systems
%N 3
%P 291-300
%U http://www.journal.univagora.ro/?page=article_details&id=374
%V 4
%X 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.
%8 30/2009