On the minimal components of substitution subshifts

Raphaël Henry

doi:10.1016/j.tcs.2025.115517

paper

On the minimal components of substitution subshifts

arXiv:2501.19326 · doi:10.1016/j.tcs.2025.115517

Abstract

In this paper we study substitutions on $A^{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.