Artículo
P Systems Computing the Period of Irreducible Markov Chains
Autor/es | Cardona Roca, Mónica
Colomer Cugat, M. Ángels Riscos Núñez, Agustín Rius Font, Miquel |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2009 |
Fecha de depósito | 2021-04-27 |
Publicado en |
|
Resumen | It is well known that any irreducible and aperiodic Markov chain has
exactly one stationary distribution, and for any arbitrary initial distribution, the se-
quence of distributions at time n converges to the stationary ... It is well known that any irreducible and aperiodic Markov chain has exactly one stationary distribution, and for any arbitrary initial distribution, the se- quence 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 irre- ducible 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 in- put. A comparative analysis with respect to another known solution is described. |
Agencias financiadoras | Ministerio de Educación y Ciencia (MEC). España Junta de Andalucía |
Identificador del proyecto | TIN2006–13425
P08-TIC-04200 |
Cita | Cardona Roca, M., Colomer Cugat, M.Á., Riscos Núñez, A. y Rius Font, M. (2009). P Systems Computing the Period of Irreducible Markov Chains. International Journal of Computers, Communications and Control, 4 (3), 291-300. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
P Systems Computing the Period ... | 100.2Kb | [PDF] | Ver/ | |