Geodesic
On permutation complexity of fixed points of some nonuniform binary morphisms
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 12 (2015), pp. 64-79

Voir la notice de l'article provenant de la source Math-Net.Ru

We study properties of infinite permutations generated by fixed points of morphism $\varphi(0)=01^{k},\varphi(1)=0$ for $k\geq{2}$, and find the formula for their factor complexity.
Keywords: permutation complexity
Mots-clés : infinite permutation, morphism. 
@article{SEMR_2015_12_a52,
     author = {A. A. Valuzhenich},
     title = {On permutation complexity of fixed points of some nonuniform binary morphisms},
     journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
     pages = {64--79},
     publisher = {mathdoc},
     volume = {12},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SEMR_2015_12_a52/}
}
TY  - JOUR
AU  - A. A. Valuzhenich
TI  - On permutation complexity of fixed points of some nonuniform binary morphisms
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2015
SP  - 64
EP  - 79
VL  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SEMR_2015_12_a52/
LA  - ru
ID  - SEMR_2015_12_a52
ER  - 
%0 Journal Article
%A A. A. Valuzhenich
%T On permutation complexity of fixed points of some nonuniform binary morphisms
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2015
%P 64-79
%V 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SEMR_2015_12_a52/
%G ru
%F SEMR_2015_12_a52
A. A. Valuzhenich. On permutation complexity of fixed points of some nonuniform binary morphisms. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 12 (2015), pp. 64-79. http://geodesic.mathdoc.fr/item/SEMR_2015_12_a52/