On the 2-abelian complexity of generalized Cantor sequences

DOI10.1016/j.tcs.2022.09.025OpenAlexW4297140416MaRDI QIDQ2087468

Xiao-Tao Lü, Jin Chen, Zhi Xiong Wen

Publication date: 21 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.025

zbMATH Keywords

regular sequence2-abelian complexitygeneralized Cantor sequence

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• On a generalization of abelian equivalence and complexity of infinite words
• On the 2-abelian complexity of the Thue-Morse word
• The ring of \(k\)-regular sequences
• On the \(k\)-abelian complexity of the Cantor sequence
• The abelian complexity of the paperfolding word
• A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
• On the abelian complexity of the Rudin-Shapiro sequence
• Computing abelian complexity of binary uniform morphic words
• Abelian complexity of minimal subshifts
• Automatic Sequences
• Sequences with minimal block growth

This page was built for publication: On the 2-abelian complexity of generalized Cantor sequences