Abstract:
In the set of finite binary sequences a Markov process is defined with discrete time in which each symbol of the binary sequence at time $t+1$ depends on the two neighboring symbols at time $t$. A proof is given of the existence and uniqueness of an invariant distribution, and its derivation is also given in a number of cases.