Some applications of computer to investigation of substitutional dynamical systems

A new sufficient condition for topological mixing of a permutational dynamical system is given. Using a computer, it was verified for a system studied earlier by other methods. For a permutation that does not satisfy the above sufficient condition, topological mixing is proved by a rather general method of recurrence relations. The formulas expressing these relations are written by a computer.