P Systems Computing the Period of Irreducible Markov Chains
Rights accessOpen Access
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→∞. 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 comparative analysis with respect to another known solution is described.
CitationCardona, M. [et al.]. P Systems Computing the Period of Irreducible Markov Chains. "Int. J. of Computers, Communications & Control", 30 Maig 2009, vol. IV, núm. 3, p. 291-300.