Discrete Mathematics & Theoretical Computer Science, Vol 16, No 3 (2014)

Font Size:  Small  Medium  Large

On permutation complexity of fixed points of uniform binary morphisms

Alexandr Valyuzhenich

Abstract


We study properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Full Text: PDF PostScript