On the minimal components of substitution subshifts

In this paper we study substitutions on $A^{\mathbb{Z}}$ where $A$ is a finite alphabet. We precisely characterize the minimal components of substitution subshifts, give an optimal bound for their number and describe their dynamics. The explicitness of these results provides a method to algorithmically compute and count the minimal components of a given substitution subshift.