Some results on digital segments and balanced words (Q6639744)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some results on digital segments and balanced words |
scientific article; zbMATH DE number 7945742
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some results on digital segments and balanced words |
scientific article; zbMATH DE number 7945742 |
Statements
Some results on digital segments and balanced words (English)
0 references
18 November 2024
0 references
The main result of the paper is a formula for the number of balanced words with a given number of occurrences of each symbol. A recursive one has been known since 2010 [\textit{N. Bedaride} et al., Discrete Math. Theor. Comput. Sci. 12, No. 3, 41--62 (2010; Zbl 1280.68145)], but here the authors give a more or less closed expression: it contains double sums of functions computed explicitly depending on the relations among parameters.
0 references
Sturmian word
0 references
balanced word
0 references
Christoffel word
0 references
digital segment
0 references
minimal forbidden word
0 references
