@article {458,
title = {Characterizing the aperiodicity of irreducible markov chains by using P Systems },
journal = {7th Brainstorming Week on Membrane Computing},
volume = {I},
year = {2009},
month = {02/02/2009},
pages = {81-96},
publisher = {F{\'e}nix Editora},
address = {Sevilla, Espa{\~n}a},
abstract = {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 {\textrightarrow} $\infty$.
In this paper, a characterization of the aperiodicity in existential terms of some state
is given. At the same time, a P system 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 formal verification of this solution is presented and a comparative analysis with respect
to another known solution is described.
},
isbn = {978-84-613-2837-6},
url = {http://www.gcn.us.es/?q=node/414},
author = {M{\'o}nica Cardona and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez}
}