|
|||||
|
|
Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture |
|
| Abstract: | 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. |
| Keywords: | Finite automaton Subword complexity Fibonacci representation Fibonacci–Thue–Morse sequence Decision procedure |
| 本文献已被 ScienceDirect 等数据库收录！ | |