On combinatorial properties of the Arshon sequence Original Research Article

We consider combinatorial and algebraic properties of the language of factors of the infinite sequence on the three-letter alphabet built by S.E. Arshon in 1930s. This sequence never contains two successive equal words, i. e., avoids the number 2. The notion of avoidability is extended from integers to rational numbers. It is shown that the avoidability bound for the considered language is 74. This language is defined by two alternating morphisms; our method allows to study it like a formal language defined by one morphism. We also give a complete description of the syntactic congruence of the considered language.