论文标题
斐波那酸thue-morse序列的子字复杂性：Dekking猜想的证明
Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
论文作者
论文摘要
最近，Dekking猜想了斐波那酸thue-morse序列的子单词复杂性函数的形式。在本说明中，我们使用自由软件胡桃木证明了他的猜想。
Recently 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.
