On abelian and additive complexity in infinite words

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-667732

All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.