arXiv Analytics

Sign in

arXiv:1710.08820 [math.CO]AbstractReferencesReviewsResources

Permutation complexity of images of Sturmian words by marked morphisms

Adam Borchert, Narad Rampersad

Published 2017-10-24Version 1

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.

Comments: 8 pages
Categories: math.CO, cs.FL
Subjects: 68R15
Related articles: Most relevant | Search more
arXiv:2003.10721 [math.CO] (Published 2020-03-24)
A gap of the exponents of repetitions of Sturmian words
arXiv:math/0308140 [math.CO] (Published 2003-08-14)
Sturmian words, $β$-shifts, and transcendence
arXiv:1509.05396 [math.CO] (Published 2015-09-17)
Words with many palindrome pair factors

Links

Toolbox