Cobham's theorem for substitutions

Details Cobham's theorem for substitutions Cobham's theorem for substitutions

2010-10-19

arxiv.org/abs/1010.4009v1

Mathematics

Combinatorics

Scientific paper

The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a complete and general version for the so-called substitutive sequences. Let $\alpha$ and $\beta$ be two multiplicatively independent Perron numbers. Then, a sequence $x\in A^\mathbb{N}$, where $A$ is a finite alphabet, is both $\alpha$-substitutive and $\beta$-substitutive if and only if $x$ is ultimately periodic.

Affiliated with

Also associated with

No associations

Rating

Cobham's theorem for substitutions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cobham's theorem for substitutions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cobham's theorem for substitutions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-269903