Alexandr Valyuzhenich - On permutation complexity of fixed points of some uniform binary morphisms

dmtcs:2096 - Discrete Mathematics & Theoretical Computer Science, July 29, 2014, Vol. 16 no. 3 - https://doi.org/10.46298/dmtcs.2096
On permutation complexity of fixed points of some uniform binary morphismsArticle

Authors: Alexandr Valyuzhenich ORCID1

  • 1 Department of Mechanics and Mathematics [Novosibisrk]

Combinatorics

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

https://doi.org/10.46298/dmtcs.2096
Source: HAL:hal-01188910v1
Volume: Vol. 16 no. 3
Section: Combinatorics
Published on: July 29, 2014
Imported on: September 12, 2012
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] Infinite permutation, Factor complexity, Morphism

Share and export

Consultation statistics

This page has been seen 533 times.
This article's PDF has been downloaded 829 times.