}t~%" the symbols in such a way that the last symbol 0)~ ({a}) has index 0. By the definition of a and b, the sequence of these concatenations is a sequence of words that is increasing on both sides, and its union is a sequence of symbols from Z that is infinite on both sides. We denote it by x(i, j, m, n' ). We consider the weak closure (in the space of all sequences that are infinite on both sides) of trajectory x(i, j, m, n') with respect to a two-sided shift. We denote it by X ~. We shall call the shift X~ -+ X~ a substitution automorphism. Under the condition that G~ is primitive, X~ does not depend on the choice of the generating quadruple. It is known that T is strictly ergodic [5]. Leningrad Scientific-Industrial Union of Medical Laboratory Technology. Translated from Matematicheskie Zametki, Vol. 44, No~ 6, pp. 785-793, December, 1988. Original article submitted April 28, 1986; revision submitted April ii, 1988.
[1]
John C. Martin,et al.
Substitution minimal flows
,
1971
.
[2]
A topological invariant of substitution minimal sets
,
1972
.
[3]
Bernard Host,et al.
Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable
,
1986,
Ergodic Theory and Dynamical Systems.
[4]
F. Dekking,et al.
Mixing properties of substitutions
,
1978
.
[5]
W. H. Gottschalk.
Substitution minimal sets
,
1963
.
[6]
A. Vershik,et al.
A theorem on the Markov periodic approximation in ergodic theory
,
1985
.
[7]
J. Cassels,et al.
An Introduction to Diophantine Approximation
,
1957
.
[8]
Coincidence values and spectra of substitutions
,
1978
.