Some results on digital segments and balanced words

Abstract

We exhibit combinatorial results on Christoffel words and binary balanced words that are motivated by their geometric interpretation as approximations of digital segments. We give a closed formula for counting the exact number of balanced words with a zeroes and b ones. We also study minimal non-balanced words.