Research of interactions in finite deterministic automata network

摘要

The model of finite deterministic goal-seeking automata network functioning is described. On the basis of the utility function increment analysis, the binary relations (conflict, cooperation, independence) between elements of automata network are defined.