A graph-theoretic proof of Cobham's Dichotomy for automatic sequences

Mieke Wessel

We give a new graph-theoretic proof of Cobham's Theorem which says that the support of an automatic sequence is either sparse or grows at least like $N^{\alpha }$ for some $\alpha >0$. The proo…