2026-04-19T14:09:09Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/64052025-07-17T13:20:20Zcom_2072_1033col_2072_452950

P Systems Computing the Period of Irreducible Markov Chains Cardona Roca, Mónica Colomer Cugat, M. Angeles Riscos Núñez, Agustín Rius Font, Miquel Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions Markov processes Parallel processing (Electronic computers) Molecular computers Markov, Processos de Ordinadors moleculars 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. Postprint (published version) 2009-05-30 Article 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. 1841-9836 https://hdl.handle.net/2117/6405 eng http://journal.univagora.ro/download/pdf/374.pdf http://creativecommons.org/licenses/by-nc-nd/3.0/es/ Open Access Attribution-NonCommercial-NoDerivs 3.0 Spain 10 p. application/pdf