Computing the k-binomial complexity of the Thue–Morse word-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Computing the k-binomial complexity of the Thue–Morse word

Published:2020-11 Issue: Volume:176 Page:105284
ISSN:0097-3165
Container-title:Journal of Combinatorial Theory, Series A
language:en
Short-container-title:Journal of Combinatorial Theory, Series A

Author:

Lejeune Marie^ORCID,Leroy Julien,Rigo Michel

Funder

FNRS

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference41 articles.

1. A short proof of the transcendence of Thue–Morse continued fractions;Adamczewski;Am. Math. Mon.,2007

2. The ubiquitous Prouhet-Thue-Morse sequence;Allouche,1999

3. Automatic Sequences. Theory, Applications, Generalizations;Allouche,2003

4. Euler, Pisot, Prouhet-Thue-Morse, Wallis and the duplication of sines;Allouche;Monatshefte Math.,2008

5. Arithmetical complexity of infinite words;Avgustinovich,2003

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Characterizations of families of morphisms and words via binomial complexities;European Journal of Combinatorics;2024-05

2. On the 2-binomial complexity of the generalized Thue–Morse words;Theoretical Computer Science;2024-02

3. Gapped Binomial Complexities in Sequences;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

4. Expansions of generalized Thue-Morse numbers;Advances in Applied Mathematics;2023-02

5. GAPS IN THE THUE–MORSE WORD;Journal of the Australian Mathematical Society;2022-01-25

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP