当前位置:
X-MOL 学术
›
Indag. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture
Indagationes Mathematicae ( IF 0.6 ) Pub Date : 2021-03-23 , DOI: 10.1016/j.indag.2021.03.004 Jeffrey Shallit
中文翻译:
Fibonacci–Thue–Morse序列的子字复杂度:Dekking猜想的证明
更新日期:2021-04-20
Indagationes Mathematicae ( IF 0.6 ) Pub Date : 2021-03-23 , DOI: 10.1016/j.indag.2021.03.004 Jeffrey Shallit
Recently F. M. Dekking conjectured the form of the subword complexity function for the Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.
中文翻译:
Fibonacci–Thue–Morse序列的子字复杂度:Dekking猜想的证明
最近,FM Dekking猜想了斐波那契-色相-摩尔斯序列的子词复杂度函数的形式。在本文中,我们使用免费软件Walnut通过纯计算手段证明了他的猜想。