加载中…
2011-08-18
Permutation complexity of the fixed points of some uniform binary morphisms
Alexander Valyuzhenich
文献摘要
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本