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 generalized to non periodic infinite words as well.
|Number of pages||17|
|Journal||International Journal of Foundations of Computer Science|
|Volume||Int. J. Found. Comput. Sci. 21(4)|
|Publication status||Published - 2010|
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)