On Factorially Balanced Sets of Words

Gwenaël Richomme 1, 2 Patrice Séébold 2, 1
1 ARITH - Arithmétique informatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : A set of words is factorially balanced if the set of all the factors of its words is balanced. We prove that if all words of a factorially balanced set have a finite index, then this set is a subset of the set of factors of a Sturmian word. Moreover, characterizing the set of factors of a given length n of a Sturmian word by the left special factor of length n−1 of this Sturmian word, we provide an enumeration formula for the number of sets of words that correspond to some set of factors of length n of a Sturmian word.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2011, 412 (39), pp.5492-5497. 〈10.1016/j.tcs.2011.06.027〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00616826
Contributeur : Gwenaël Richomme <>
Soumis le : mercredi 24 août 2011 - 15:15:25
Dernière modification le : jeudi 11 janvier 2018 - 06:26:07

Identifiants

Collections

Relations

Citation

Gwenaël Richomme, Patrice Séébold. On Factorially Balanced Sets of Words. Theoretical Computer Science, Elsevier, 2011, 412 (39), pp.5492-5497. 〈10.1016/j.tcs.2011.06.027〉. 〈lirmm-00616826〉

Partager

Métriques

Consultations de la notice

70