Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2010

On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet

Résumé

We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$. We give generating functions and study the asymptotic behaviour. As a particular case, we focus on the symmetrical discrete segments which are encoded by balanced palindromes.

Fichier principal
Vignette du fichier
BeDoJaRe.pdf (208.99 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00580064 , version 2 (29-03-2011)
hal-00580064 , version 1 (17-03-2021)

Licence

Identifiants

Citer

Nicolas Bédaride, Eric Domenjoud, Damien Jamet, Jean-Luc Rémy. On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 3 (3), pp.41-62. ⟨10.46298/dmtcs.474⟩. ⟨hal-00580064v2⟩
520 Consultations
1577 Téléchargements

Altmetric

Partager

  • More