Abstract:
The problem of synchronizing two-way networks of identical automata is considered. For any $n(n\geq 2)$ an automaton $\mathfrak A$ is constructed such that any two-way network of an arbitrary number of such automata is synchronized within a certain time.