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. 
Alexander Valyuzhenich (Novosibirsk State University)
cs.DM