Some results on digital segments and balanced words
Year: 2024
Type: article
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.
Source: Theoretical Computer Science
Authors: Alessandro De Luca, Gabriele Fici
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,800
OpenAlex ID: W4403707703
