Geodesic
Permutation complexity of images of Sturmian words by marked morphisms
Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 1.

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2018_20_1_a21,
     author = {Borchert, Adam and Rampersad, Narad},
     title = {Permutation complexity of images of {Sturmian} words by marked morphisms},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {20},
     number = {1},
     year = {2018},
     doi = {10.23638/DMTCS-20-1-20},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-1-20/}
}
TY  - JOUR
AU  - Borchert, Adam
AU  - Rampersad, Narad
TI  - Permutation complexity of images of Sturmian words by marked morphisms
JO  - Discrete mathematics & theoretical computer science
PY  - 2018
VL  - 20
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-1-20/
DO  - 10.23638/DMTCS-20-1-20
LA  - en
ID  - DMTCS_2018_20_1_a21
ER  - 
%0 Journal Article
%A Borchert, Adam
%A Rampersad, Narad
%T Permutation complexity of images of Sturmian words by marked morphisms
%J Discrete mathematics & theoretical computer science
%D 2018
%V 20
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-1-20/
%R 10.23638/DMTCS-20-1-20
%G en
%F DMTCS_2018_20_1_a21
Borchert, Adam; Rampersad, Narad. Permutation complexity of images of Sturmian words by marked morphisms. Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 1. doi : 10.23638/DMTCS-20-1-20. http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-1-20/

Cité par Sources :