A short proof of a theorem of Cobham on substitutions

DOI10.1216/RMJ-2014-44-1-19MaRDI QIDQ2453629zbMATH OpenFDO

Authors Ethan Coven, Andrew Dykstra, Michelle LeMasurier

Publication date 10 June 2014

Published in Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.4665, https://projecteuclid.org/euclid.rmjm/1401740488

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Topological and differentiable equivalence, conjugacy, moduli, classification of dynamical systems (37C15)

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.

Recommendations

• Cobham's theorem for substitutions
• Substitutive systems and a finitary version of Cobham's theorem
• A theorem of Cobham for non-primitive substitutions
• Substitutions and \(\beta\) systems of numeration
• scientific article; zbMATH DE number 1984012

Cites work

• A characterization of the Morse minimal set up to topological conjugacy
• Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• On the base-dependence of sets of numbers recognizable by finite automata
• The spectrum of dynamical systems arising from substitutions of constant length

Cited in

(10)

• Substitutive systems and a finitary version of Cobham's theorem
• Topological conjugacy to given constant length substitution minimal systems
• Syndeticity and independent substitutions
• Computing automorphism groups of shifts using atypical equivalence classes
• Topological conjugacy of constant length substitution dynamical systems
• Topological conjugacy for the Morse minimal system: an example
• Cobham's theorem for substitutions
• Substitutions and \(\beta\) systems of numeration
• Obstacles to topological factoring of Toeplitz shifts
• Cobham's theorem for the Gaussian integers

This page was built for publication: A short proof of a theorem of Cobham on substitutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453629)