The Thue-Morse set T is the set of those non-negative integers whose binary expansions have an even number of 1. The name of this set comes from the fact that its characteristic sequence is given by the famous Thue-Morse word abbabaabbaababba..., which is the fixed point starting with a of the word morphism sending a to ab and b to ba. The numbers in T are sometimes called the evil numbers. We obtain an exact formula for the state complexity (i.e. the number of states of its minimal automaton) of the multiplication by a constant of the Thue-Morse set with respect to any integer base b which is a power of 2. Our proof is constructive and we are able to explicitly provide the minimal automaton of the language of all 2^p-expansions of the set mT for any positive integers m and p. The used method is general for any b-recognizable set of integers. As an application, we obtain a decision procedure running in quadratic time for the problem of deciding whether a given 2^p-recognizable set is equal to some multiple of the Thue-Morse set.
The Smallest String Attractors of Fibonacci, Period-Doubling, and Thue--Morse Words
Graduate School of Informatics, Nagoya University(名古屋大学情报大学院);M&D Data Science Center, Institute of Science Tokyo(东京科学大学M&D数据科学中心);Department of Computer Science and Engineering, University of Yamanashi(山梨大学计算机科学与工程系);Graduate School of Informatics and Engineering, University of Electro-Communications(电波大学信息与工程学研究生院)
Smallest String Attractors and Minimal Coverage Certificates of Thue--Morse Words
University of Catania(卡塔尼亚大学);Univ Rouen Normandie, INSA Rouen Normandie, Université Le Havre Normandie, Normandie Univ(鲁昂诺曼底大学,鲁昂国立应用科学学院,勒阿弗尔诺曼底大学,诺曼底大学);University of Palermo(巴勒莫大学)