Note on a Fibonacci Parity Sequence
Formal Languages and Automata Theory
2022-03-22 v1 Discrete Mathematics
Combinatorics
Abstract
Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in Fibonacci representation. In this note we show how, using the Walnut theorem-prover, to obtain a measure of its complexity, previously studied by Jamet, Popoli, and Stoll. We strengthen one of their theorems and disprove one of their conjectures.
Cite
@article{arxiv.2203.10504,
title = {Note on a Fibonacci Parity Sequence},
author = {Jeffrey Shallit},
journal= {arXiv preprint arXiv:2203.10504},
year = {2022}
}