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

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]

This page has been seen 88 times.

This article's PDF has been downloaded 150 times.