Note on a Fibonacci parity sequence

DOI10.1007/s12095-022-00592-5zbMath1518.11008arXiv2203.10504OpenAlexW4287831739WikidataQ114849096 ScholiaQ114849096MaRDI QIDQ6159442

Jeffrey O. Shallit

Publication date: 20 June 2023

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.10504

zbMATH Keywords

binary sequenceFibonacci representationZeckendorf expansionmaximum order complexity

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Automata sequences (11B85) Sequences (mod (m)) (11B50)

Cites Work

• Unnamed Item
• Unnamed Item
• Automata and numeration systems
• Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
• Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
• Synchronized sequences
• The sum of digits functions of the Zeckendorf and the base phi expansions
• An analogue of the Thue-Morse sequence
• Decision algorithms for Fibonacci-automatic Words, I: Basic results
• Möbius orthogonality for the Zeckendorf sum-of-digits function
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• The Logical Approach to Automatic Sequences

This page was built for publication: Note on a Fibonacci parity sequence