Alexander Valyuzhenich (Novosibirsk State University) |

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. |

Published: 17th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.63.32 | bibtex |

Comments and questions to: eptcs@eptcs.org |

For website issues: webmaster@eptcs.org |