“…The smallest complexity for an aperiodic sequence is 𝑝 𝐚 (𝑛) = 𝑛+1, which is attained precisely by Sturmian sequences; see, for example, [18,Theorem 2.1.5]. By [10, Proposition 2.1], all aperiodic words with lim sup 𝑝 𝐚 (𝑛) 𝑛 < 4 3 are essentially equal to 𝝈(1 ∞ ) with 𝝈 = (𝜏 𝑗 𝑛 ,𝑘 𝑛 ) 𝑛⩾1 ∈ 𝑆 ∞ (and 𝑘 𝑛 ⩽ 2𝑗 𝑛 +1 or (𝑗 𝑛 , 𝑘 𝑛 ) = (0, 2)). Without conditions on 𝑗 𝑛 , 𝑘 𝑛 , we get the following upper bound for 𝑝 𝝈(1 ∞ ) (𝑛), which is optimal since…”