Permutation complexity of images of Sturmian words by marked morphisms
Combinatorics
2023-06-22 v4 Formal Languages and Automata Theory
Abstract
We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is for some constant and all lengths sufficiently large.
Keywords
Cite
@article{arxiv.1710.08820,
title = {Permutation complexity of images of Sturmian words by marked morphisms},
author = {Adam Borchert and Narad Rampersad},
journal= {arXiv preprint arXiv:1710.08820},
year = {2023}
}
Comments
9 pages