2022/12/20 by Yanxi Li, Wen Wu, Li, Yanxi +1
Computer Science · #68R15 #Coding theory and cryptography #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2212.10069
openalex publication_date 2022/12/20 · openalex created_date 2023/02/13 · openalex updated_date 2026/07/28
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 f given by Zhang, Wen and Wu [Electron. J. Comb., 24 (2017)]. The N-factor complexity of a class of digit sequences, whose nth term is defined to be the number of occurrences of a given block in the base-k representation of n, is also discussed.