2000 character limit reached
Permutation complexity of the fixed points of some uniform binary morphisms (1108.3641v1)
Published 18 Aug 2011 in cs.DM
Abstract: 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.