P Systems Computing the Period of Irreducible Markov Chains
نویسندگان
چکیده
منابع مشابه
The Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملCharacterizing the Aperiodicity of Irreducible Markov Chains by Using P Systems
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 ...
متن کاملModel Reduction of Irreducible Markov Chains
We are interested in developing computational tools for reducing the state space of irreducible Markov chains. As means of decreasing the dimensionality of a given Markov chain we study the concept of aggregation. The approximation error between the original and the reduced order model is captured by a metric that penalizes the asymptotic deviation of the outputs of the two systems. For the cas...
متن کاملMolecular Computing for Markov Chains
In this paper, it is presented a methodology for implementing arbitrarily constructed time-homogenous Markov chains with biochemical systems. Not only discrete but also continuous-time Markov chains are allowed to be computed. By employing chemical reaction networks (CRNs) as a programmable language, molecular concentrations serve to denote both input and output values. One reaction network is ...
متن کاملMarkov chains for random dynamical systems on p-adic trees
We study Markovian and non-Markovian behaviour of stochastic processes generated by random dynamical systems on p-adic trees. In fact, such systems can be interpreted as stochastic neural networks operating on branches of the homogeneous p-adic tree (where p > 1 is a prime number). Key-Words: Random dynamical systems, p-adic numbers, Markovian property
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2009
ISSN: 1841-9836,1841-9836
DOI: 10.15837/ijccc.2009.3.2437