A. A. Valuzhenich, “On permutation complexity of fixed points of some nonuniform binary morphisms”, Sib. Èlektron. Mat. Izv., 2015, Volume 12,Pages <nobr>64

Discrete mathematics and mathematical cybernetics

On permutation complexity of fixed points of some nonuniform binary morphisms

A. A. Valuzhenich

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk

Abstract: 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, infinite permutation, morphism.

UDC: 519.1

MSC: 68R15

Received September 17, 2012, published February 1, 2015

DOI: 10.17377/semi.2015.12.006