arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.07676cs.FL
收藏

Thue-Morse集的多重数的状态复杂性

State Complexity of the Multiples of the Thue-Morse Set

Émilie Charlier, Célia Cisternino, Adeline Massuir

摘要:

Thue-Morse集合T是那些非负整数的集合,它们的二进制展开式具有偶数1。这个集合的名字来自于这样一个事实,即它的特征序列是由著名的Thue-Morse单词abbabaabbaababba.给出的,它是从a开始的词态射的固定点,将a发送到ab,将b发送到ba。T中的数字有时被称为邪恶数字。我们得到了一个精确的公式的状态复杂性(即其最小自动机的状态数)乘以一个常数的Thue-Morse集关于任何整数基b是2的幂。我们的证明是建设性的,我们能够明确地提供的语言的所有2^p-扩展的集合mT的任何正整数m和p的最小自动机。所使用的方法是一般的任何b-可识别的整数集。作为应用,我们得到了判定给定的2^p-可识别集是否等于Thue-Morse集的某个倍数的二次时间判定过程.

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑