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.
De Luca A., Fici G. (2024). Some results on digital segments and balanced words. THEORETICAL COMPUTER SCIENCE, 1021 [10.1016/j.tcs.2024.114935].
Some results on digital segments and balanced words
Fici G.
2024-12-21
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S0304397524005528-main.pdf
Solo gestori archvio
Descrizione: main paper
Tipologia:
Versione Editoriale
Dimensione
1.07 MB
Formato
Adobe PDF
|
1.07 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
