Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture (Q2020439)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
scientific article

    Statements

    Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture (English)
    0 references
    23 April 2021
    0 references
    Dekking formulated a conjecture about the subword complexity of the Fibonacci-Thue-Morse sequence, and this is proved here. The argument is computational, and uses a decision procedure carried out using a software package called Walnut.
    0 references
    finite automaton
    0 references
    subword complexity
    0 references
    Fibonacci representation
    0 references
    Fibonacci-Thue-Morse sequence
    0 references
    decision procedure
    0 references
    0 references

    Identifiers