arXiv · 1108.4665
A short proof of a theorem of Cobham on substitutions
Abstract
This paper is concerned with the lengths of constant length substitutions that generate topologically conjugate systems. We show that if the systems are infinite, then these lengths must be powers of the same integer. This result is a dynamical formulation of a special case of a 1969 theoretical computer science result of Alan Cobham. Our proof is rather simple.
Explore related subjects
Keep this discovery
Ethan M. Coven, Andrew Dykstra, Michelle LeMasurier. 2011-08-23. A short proof of a theorem of Cobham on substitutions. https://arxiv.org/abs/1108.4665
Cite the original work for its findings. Save a collection to share your selection of sources.