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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.