https://hal.inria.fr/hal-01188910Valyuzhenich, AlexandrAlexandrValyuzhenichDepartment of Mechanics and Mathematics [Novosibisrk] - NSU - Novosibirsk State UniversityOn permutation complexity of fixed points of some uniform binary morphismsHAL CCSD2014Infinite permutationFactor complexityMorphism[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Episciences Iam, Coordination2015-08-31 17:03:412017-09-07 01:03:412015-09-01 13:25:19enJournal articleshttps://hal.inria.fr/hal-01188910/document10.46298/dmtcs.2096application/pdf1We study properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.