Symmetric Games for Large Aggregates of Probabilistic Automata

Equations are proposed for the approximate description of a system of interacting automata in which the transition probability of an automaton from one state to another is a symmetric function of the states of all the automata. It is proved that the solution of the approximate equations converges to the exact solution as the number of automata is increased without bound.