Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
arXiv:2010.10956
Abstract
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.