On a class of infinite words with affine factor complexity

Details On a class of infinite words with affine factor complexity On a class of infinite words with affine factor complexity

2006-12-16

arxiv.org/abs/math/0612466v2

Mathematics

Combinatorics

14 pages

Scientific paper

In this article, we consider the factor complexity of a fixed point of a
primitive substitution canonically defined by a beta-numeration system. We
provide a necessary and sufficient condition on the Renyi expansion of 1 for
having an affine factor complexity map C(n), that is, such that C(n)=an+b for
any integer n.

Affiliated with

Also associated with

No associations

Rating

On a class of infinite words with affine factor complexity 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 On a class of infinite words with affine factor complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a class of infinite words with affine factor complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-369273