On the additive complexity of a Thue-Morse like sequence
Jin Chen, Zhixiong Wen, Wen Wu

TL;DR
This paper analyzes the additive complexity of a Thue-Morse like sequence generated by a specific morphism, revealing an exact logarithmic formula and its regularity properties.
Contribution
It provides a precise formula for the additive complexity of a generalized Thue-Morse sequence and establishes its 2-regularity.
Findings
Additive complexity follows a logarithmic pattern: 2*floor(log2(n))+3.
The sequence of additive complexities is 2-regular.
The formula applies for all integers n ≥ 1.
Abstract
In this paper, we study the additive complexity of a Thue-Morse like sequence with the morphism . We show that for all integers . Consequently, is a -regular sequence.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Coding theory and cryptography · Computability, Logic, AI Algorithms
