Abstract
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 σl,m(a) = albm and σl,m(a) = a.
Subject
Computer Science Applications,General Mathematics,Software
Reference12 articles.
1. Allouche J.-P. and Shallit J., Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, UK (2003).
2. Berstel J., Mots de Fibonacci, L.I.T.P. Séminaire d'informatique Théorique, Paris (1980–1981), 57–78.
3. On extremal properties of the Fibonacci word
4. Cassaigne J., An algorithm to test if a given circular HDOL-language avoids a pattern, in IFIP World Computer Congress'94, North-Holland (1994) 459–464.