|
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.
Received September 17, 2012, published February 1, 2015
Citation:
A. A. Valuzhenich, “On permutation complexity of fixed points of some nonuniform binary morphisms”, Sib. Èlektron. Mat. Izv., 12 (2015), 64–79
Linking options:
https://www.mathnet.ru/eng/semr569 https://www.mathnet.ru/eng/semr/v12/p64
|
|