LAUSR

Abstract Maloney and Rust (2016) introduced the concept of “tameness” to simplify the study of minimal substitution subshifts. We introduce the concept of “l-primitivity” for these substitutions, and show that the combination of these two conditions can characterise the minimality of substitution subshifts. As an application, we show that a previous result stating that an admissible substitution subshift is minimal if and only if it is linearly repetitive is valid for all substitution subshifts. The above set of conditions can be checked by a finite number of calculations, i.e. algorithmically.