On the Complexity of the Generalized Fibonacci Words
Résumé
In this paper we undertake a general study of the complexity function of the generalized Fibonacci words which are generated by the morphism defined by σ(a) = a^l b^m and σ(b) = a .
Domaines
Combinatoire [math.CO]Origine | Fichiers éditeurs autorisés sur une archive ouverte |
---|