回文复杂度
Palindrome complexity
摘要：
本文研究了有限字母表上无穷序列的回文复杂性，即，在给定序列中出现的给定长度的回文因子（块）的数量。我们调查了已知的结果，并获得了新的结果，一些序列，特别是Rote序列和不动点的原始态射的恒定长度属于类P的Hof-Knill-Simon取代。我们还根据序列的（块）复杂度给出了序列的回文复杂度的一个上界。
英文摘要：
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to the class P substitutions of Hof-Knill-Simon. We also give an upper bound for the palindrome complexity of a sequence in terms of its (block-)complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
