
Abstract In this paper we propose a model for interaction between random environments and random automata. To this model we can apply the theory of (generalized) random systems with complete connections (i.e., learning models or dynamic models) in order to describe its behavior. We shall call such a system a general control system. Next criteria and conditions of expediency of a random automaton within such a system are formulated. Finally two special cases are examined.
random systems with complete connections, Learning and adaptive systems in artificial intelligence, learning automata, interaction between random environments and random automata, Formal languages and automata, Control/observation systems in abstract spaces, General systems, learning algorithms
random systems with complete connections, Learning and adaptive systems in artificial intelligence, learning automata, interaction between random environments and random automata, Formal languages and automata, Control/observation systems in abstract spaces, General systems, learning algorithms
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
