On subshifts with slow forbidden word growth
On subshifts with slow forbidden word growth
Abstract In this work, we treat subshifts, defined in terms of an alphabet $\mathcal {A}$ and (usually infinite) forbidden list $\mathcal {F}$ , where the number of n -letter words in $\mathcal {F}$ has ‘slow growth rate’ in n . We show that such subshifts are well behaved in several …