Mathematics – Combinatorics

Scientific paper

[
0.00
] – not rated yet
Voters
0
Comments 0

2011-07-23

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.

**Ardal Hayri**

Mathematics – Combinatorics

Scientist

**Brown Tom**

Physics – High Energy Physics – High Energy Physics - Phenomenology

Scientist

**Jungic Veselin**

Mathematics – Combinatorics

Scientist

**Sahasrabudhe Julian**

Mathematics – Combinatorics

Scientist

No associations

LandOfFree

If you have personal experience with

On abelian and additive complexity in infinite wordsdoes not yet have a rating. At this time, there are no reviews or comments for this scientific paper.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.

Profile ID: LFWR-SCP-O-667732

Use Google custom search:

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