arXiv · 2501.19326
On the minimal components of substitution subshifts
Abstract
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.
Explore related subjects
Keep this discovery
Raphaël Henry. 2025-01-31. On the minimal components of substitution subshifts. https://doi.org/10.1016/j.tcs.2025.115517
Cite the original work for its findings. Save a collection to share your selection of sources.