期刊文献+

3-fold Morse序列的因子复杂度以及与其相似的一个排列(英文)

Factor Complexityand a Permutation Similar to the 3-fold Morse Sequence
下载PDF
导出
摘要 我们证明3-fold Morse序列的一些性质,并且给出它的子词复杂度公式.此外,通过迭代一个映射产生一个实数序列,我们研究它的一些性质.最终证明这个实数序列与3-fold Morse产生相同的无穷排列. Some combinatorial properties of the 3-fold Morse sequence are considered and the factor complexity formula is established.Furthermore,another sequence is constructed by iterating a morphism and some properties of it will be investigated.Finally we show that the above two sequences generate the same infinite permutation.
作者 刘秋霞 牛敏
出处 《应用数学》 CSCD 北大核心 2014年第4期899-905,共7页 Mathematica Applicata
基金 Supported by the National Natural Science Foundation of China under Grant(11201026) the Fundamental Research Funds for the Central Universities
关键词 3-fold Morse序列 无穷排列 因子复杂度 3-fold Morse sequence Infinite permutation Factor complexity
  • 相关文献

参考文献8

  • 1Avgustinovich S V,Frid A E,Kamae T,Salimov P V. Infinite permutations of lowest maximal patterncomplexity[J], Theoret. Comput. Sci. ,2011,412 : 2911-2921.
  • 2Berthe V. Ferenczi S. Mauduit C,Siegel A, Substitutions in dynamics* arithmetics and combinatorics[G]//Lecture Notes in Mathematics. Berlin : Springer,2002.
  • 3Fon-Der-Flaass D G’Frid A E. On periodicity and low complexity of infinite permutations[J]. EuropeanJ. Combin. ,2007,28 : 2106-2114.
  • 4Makarov M A. On permutations generated by infinite binary words[J]. Sib. Elektron. Mat. Izv.,2006,3 :304-311.
  • 5Makarov M A. On an infinite permutation similar to the Thue-Morse word[J], Discrete Math. ,2009,309:6641-6643.
  • 6Makarov M A. On the permutations generated by the Sturmian words[J]. Siberian Math. J. , 2009,50 :674-680.
  • 7Makarov M A. On the infinite permutation generated by the period doubling word[J]. European J.Combin. ,2010,31 : 368-378.
  • 8Widmer S. Permutation complexity of the Thue-Morse word[J], Advances in Appl. Math. , 2011.47 :309-329.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部