Skip to Main content Skip to Navigation

On Factorially Balanced Sets of Words

Gwenaël Richomme 1, 2 Patrice Séébold 1, 2 
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 one 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.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Gwenaël Richomme Connect in order to contact the contributor
Submitted on : Saturday, July 31, 2010 - 3:57:15 PM
Last modification on : Friday, August 5, 2022 - 10:45:46 AM
Long-term archiving on: : Thursday, November 4, 2010 - 10:21:48 AM


Files produced by the author(s)


  • HAL Id : lirmm-00507782, version 1


Gwenaël Richomme, Patrice Séébold. On Factorially Balanced Sets of Words. [Research Report] RR-10028, Lirmm. 2010. ⟨lirmm-00507782⟩



Record views


Files downloads