Let $\Sigma\subset A^{\mathbb Z_{\ge 0}}$ be a nonempty one-sided subshift over a finite alphabet and let $\sigma:\Sigma\to\Sigma$ be the shift. For $n\in\mathbb{N}$, let $\mathcal L_n(\Sigma)$ denote the set of length-$n$ words appearing in points of $\Sigma$. Then