RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1970 Volume 6, Issue 4, Pages 56–65 (Mi ppi1770)

A Group of Gain-Comparing Automata

Yu. V. Chaikovskii


Abstract: The behavior of large groups of identical automata in random media is studied. The probability of a change of action for each automaton is determined by comparing the gains over a group of automata. For the case in which the group comprises all the automata, the author formulates the corresponding continuous automata and gives the systems of differential equations describing the behavior of infinitely large groups of such automata. It is shown that these groups tend to the optimum behavior in a number of types of random media. A machine experiment is described which shows, for a particular case, that the behavior of a finite number of finite comparing automata is quasioptimum.

UDC: 62-507

Received: 21.07.1967
Revised: 11.11.1968


 English version:
Problems of Information Transmission, 1970, 6:4, 328–335

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024