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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。