A characterization of substitutive sequences using return words

Fabien Durand (1)

1 LAMFA - Laboratoire Amiénois de Mathématique Fondamentale et Appliquée

We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.

Mots clés: substitutions; return words

Domaines: Combinatoire [math.CO]

Fabien Durand. A characterization of substitutive sequences using return words. Discrete Mathematics, 1998, 179, pp.89-101. ⟨hal-00303319⟩