Permutation complexity of images of Sturmian words by marked morphismsArticle
Authors: Adam Borchert ; Narad Rampersad
NULL##NULL
Adam Borchert;Narad Rampersad
We show that the permutation complexity of the image of a Sturmian word by a
binary marked morphism is n+k for some constant k and all lengths n
sufficiently large.