On abelian and additive complexity in infinite words

Details On abelian and additive complexity in infinite words On abelian and additive complexity in infinite words

2011-07-23

arxiv.org/abs/1107.4654v1

Mathematics

Combinatorics

Scientific paper

The study of the structure of infinite words having bounded abelian
complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this
note we define bounded additive complexity for infinite words over a finite
subset of Z^m. We provide an alternative proof of one of the results of
Richomme, Saari, and Zamboni.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-667732