A short proof of a theorem of Cobham on substitutions
classification
🧮 math.DS
keywords
cobhamlengthsproofresultsubstitutionssystemsalancase
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.