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.
Domains
Discrete Mathematics [cs.DM]
Origin : Publisher files allowed on an open archive
Loading...