D Creutz,
R Pavlov - Forum of Mathematics, Sigma, 2023 - cambridge.org
We prove results about subshifts with linear (word) complexity, meaning that $\limsup\frac {p
(n)}{n}<\infty $, where for every n, $ p (n) $ is the number of n-letter words appearing in …