arXiv · 1712.05340
Shifts of finite type and random substitutions
Abstract
We prove that every topologically transitive shift of finite type in one dimension is topologically conjugate to a subshift arising from a primitive random substitution on a finite alphabet. As a result, we show that the set of values of topological entropy which can be attained by random substitution subshifts contains all Perron numbers and so is dense in the positive real numbers. We also provide an independent proof of this density statement using elementary methods.
Explore related subjects
Keep this discovery
Philipp Gohlke, Dan Rust, Timo Spindeler. 2017-12-14. Shifts of finite type and random substitutions. https://doi.org/10.3934/dcds.2019206
Cite the original work for its findings. Save a collection to share your selection of sources.