Permutation complexity of the fixed points of some uniform binary morphisms

Alexander Valyuzhenich
2011 Electronic Proceedings in Theoretical Computer Science  
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.
doi:10.4204/eptcs.63.32 fatcat:bmyzl6ol2ja6bbxovrxfsjat24