Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture

Autor:	Jeffrey Shallit
Rok vydání:	2021
Předmět:	Sequence Mathematics::Combinatorics Fibonacci number Conjecture General Mathematics 010102 general mathematics Thue–Morse sequence 010103 numerical & computational mathematics 01 natural sciences Combinatorics Computer Science::Discrete Mathematics Complexity function 0101 mathematics Computer Science::Formal Languages and Automata Theory Mathematics
Zdroj:	Indagationes Mathematicae. 32:729-735
ISSN:	0019-3577
DOI:	10.1016/j.indag.2021.03.004
Popis:	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 .
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::3a1c4a2df2db4505ba29cf9581dd5379 https://doi.org/10.1016/j.indag.2021.03.004 Zobrazit plný text záznamu Full Text from ScienceDirect