替代序列的复杂性-计算二进制字母表上替代序列的复杂性
Complexity of Substitutive Sequences - Calculation of the Complexities of Substitutive Sequences Over a Binary Alphabet
摘要：
本文研究了二进制字母表上置换序列的复杂性。通过研究各种类型的特殊词，我们表明，知道一些初始值，其复杂性可以完全制定通过一个递归公式所确定的特征多项式。
英文摘要：
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula determined by the characteristic polynomial.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
