P Systems Computing the Period of Irreducible Markov Chains
Visualitza/Obre
Tipus de documentArticle
Data publicació2009-05-30
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
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→∞.
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.
CitacióCardona, 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.
ISSN1841-9836
Versió de l'editorhttp://journal.univagora.ro/download/pdf/374.pdf
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
psystems_rius.pdf | 102,5Kb | Visualitza/Obre |