Some Results on Digital Segments and Balanced Words
arXiv:2211.09417 · doi:10.1016/j.tcs.2024.114935
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 zeroes and ones. We also study minimal non-balanced words.
17 pages, 5 figures