International Conference
"Modern Problems of Mathematics, Informatics and Bioinformatics",
devoted to the 100th anniversary of professor Alexei A. Lyapunov

Novosibirsk, Russia, 2011, October 11-14

Valyuzhenich A.  

Permutation complexity of the fixed points of some uniform binary morphisms

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.