Skip to Main content Skip to Navigation
Journal articles

On permutation complexity of fixed points of some uniform binary morphisms

Abstract : We study properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
Document type :
Journal articles
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01188910
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 31, 2015 - 5:03:41 PM
Last modification on : Thursday, September 7, 2017 - 1:03:41 AM
Long-term archiving on: : Tuesday, December 1, 2015 - 10:43:55 AM

File

dmtcs-16-3-6.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01188910, version 1

Collections

Citation

Alexandr Valyuzhenich. On permutation complexity of fixed points of some uniform binary morphisms. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 3 (in progress) (3), pp.95--128. ⟨hal-01188910⟩

Share

Metrics

Record views

120

Files downloads

953