Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture (Q2020439)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.795591413974762
0 references
0.7592661380767822
0 references
0.7534509301185608
0 references
0.7521325945854187
0 references
