Properties of a class of Toeplitz words (Q2672565)

Toeplitz words are infinite words formed by an iterative process, specified by a sequence of one or more Toeplitz patterns. The Stewart words are Toeplitz words specfied by infinite sequences of Toeplitz patterns of the form \(\alpha\beta\gamma\), where \(\alpha\), \(\beta\), \(\gamma\) is any permutation of the symbols \(0,1,?\). In this paper the authors study the properties of the uncountable set of these Stewart words: their critical exponent, avoidance of the pattern \(xxyyxx\). They find all factors that are palindromes and determine their subword complexity. Making use of a convenient ``Stewart automaton'' purposedly defined, they can then produce automatic proofs using the Walnut software and first-order logic.