E-catalog        

Библиогр.: 3 назв.

Рассматривается дискретная двоичная динамическая система (Sn,f), n > 1, состояниями которой являются все возможные двоичные векторы длины n, с эволюционной функцией вида f = (xn, 0,..., 0,xi) и двудольным графом зависимостей. Приводится теорема, определяющая аттракторы, их вид и количество, в рассматриваемых системах. One discrete binary dynamic system (Sn, f), n > 1, with bipartite dependency graph is considered. The states of such a system are all possible binary vectors of length n, and evolutionary function is f = (xn, 0,..., 0,xi). In this case, f is associated with a bipartite directed dependency graph with vertices set (a1,... ,an,e} and with arcs from a1 to an, from an to a1 and from a^ to e, 1 < i < n. The map of the (S3, f) system with the evolutionary function f = (x3, 0,xi) and its bipartite dependency graph are presented. A theorem is given on the type and number of attractors in these systems. Namely, the system has two attractors of length 1: 0n and 10n-21, and one attractor of length 2 formed by states 00n-21 and 10n-20.