Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Theoretical Computer Science
Balanced sequences and optimal routing
Journal of the ACM (JACM)
Burrows--Wheeler transform and Sturmian words
Information Processing Letters
m-Balanced words: a generalization of balanced words
Theoretical Computer Science
Hi-index | 0.00 |
We study balance properties of circular words over alphabets of size greater than two. We give some new characterizations of balanced words connected to the Kawasaki-Ising model and to the notion of derivative of a word. Moreover we consider two different generalizations of the notion of balance, and we find some relations between them. Some of our results can be generalised to non periodic infinite words as well.