Valyuzhenich, Alexandr - 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 (in progress)
On permutation complexity of fixed points of some uniform binary morphisms

Authors: Valyuzhenich, Alexandr

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


Source : oai:HAL:hal-01188910v1
Volume: Vol. 16 no. 3 (in progress)
Section: Combinatorics
Published on: July 29, 2014
Submitted on: September 12, 2012
Keywords: Infinite permutation,Factor complexity,Morphism,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Browsing statistics

This page has been seen 17 times.
This article's PDF has been downloaded 38 times.