Permutation complexity of images of Sturmian words by marked morphisms

Abstract

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.

Keywords

• mathematics - combinatorics
• computer science - formal languages and automata theory
• 68r15