Published online by Cambridge University Press: 17 March 2021
We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [On the complexity function for sequences which are not uniformly recurrent. Dynamical Systems and Random Processes (Contemporary Mathematics, 736). American Mathematical Society, Providence, RI, 2019, pp. 125--137]. We also bound the number of generic measures such a subshift can support based on its complexity function. Our measure-theoretic bounds generalize those of Boshernitzan [A unique ergodicity of minimal symbolic flows with linear block growth. J. Anal. Math.44(1) (1984), 77–96] and are closely related to those of Cyr and Kra [Counting generic measures for a subshift of linear growth. J. Eur. Math. Soc.21(2) (2019), 355–380].