N-factor complexity of the infinite Fibonacci sequence and digital sequences

arXiv2212.10069MaRDI QIDQ6421073FDOQ6421073

Authors: YanXi Li, Wen Wu 

Publication date: 20 December 2022

Abstract: In this paper, we introduce a variation of the factor complexity, called the $N$-factor complexity, which allows us to characterize the complexity of sequences on an infinite alphabet. We evaluate precisely the $N$-factor complexity for the infinite Fibonacci sequence $mathbff$ given by Zhang, Wen and Wu [Electron. J. Comb., 24 (2017)]. The $N$-factor complexity of a class of digit sequences, whose $n$th term is defined to be the number of occurrences of a given block in the base-$k$ representation of $n$, is also discussed.

Mathematics Subject Classification ID

Combinatorics on words (68R15)

This page was built for publication: $N$-factor complexity of the infinite Fibonacci sequence and digital sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6421073)