Frequencies of subwords in words of linear subword complexity

Jason Bell, Laindon Burnett, Chris Schulz

Using a method of Balková--Pelantová, we show that if $\mathbf{w}$ is a right-infinite word over a finite alphabet, then for each nonnegative integer $N$ there are at most $3(p_{\bf w…