Abstract:
Systems are considered that consist of an infinite number of interconnected finite probabilistic automata operating in discrete time. Systems are called ergodic if they “forget” their initial state in the limit with respect to time. A sufficient condition for ergodicity is given. Two examples are cited of families of systems that are ergodic for positive parameter values and possess the opposite property of zero values.