Some Results on Digital Segments and Balanced Words
Formal Languages and Automata Theory
2024-11-14 v3 Discrete Mathematics
Combinatorics
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.
Cite
@article{arxiv.2211.09417,
title = {Some Results on Digital Segments and Balanced Words},
author = {Alessandro De Luca and Gabriele Fici},
journal= {arXiv preprint arXiv:2211.09417},
year = {2024}
}
Comments
17 pages, 5 figures