On the k-abelian complexity of the Cantor sequence

2017/03/12 by Jin Chen, Chen, Jin, Xiao-Tao Lü +3
Computer Science · #11B85 #68R15 #Advanced Algebra and Logic #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Number Theory (math.NT) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1703.04063

openalex publication_date 2017/03/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we prove that for every integer k ≥ 1, the k-abelian complexity function of the Cantor sequence c = 101000101⋯ is a 3-regular sequence.

Related

• The abelian complexity of the paperfolding word
• Abelian Complexity and Synchronization
• Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
• Descriptive complexity in Cantor series
• On the additive complexity of a Thue-Morse like sequence