A short proof of a theorem of Cobham on substitutions

preprint2011arXivOpen access

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 this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.