Toeplitz语言的可能增长
On possible growth of Toeplitz languages
摘要：
我们考虑一类新的阶乘语言，其子字复杂度增长为$Θ(n^α)$，其中$α$是某个超越方程的根。分析方法，特别是维纳-皮特定理的推论，被用来找到的复杂性的渐近增长。阶乘语言被认为是语言的算术因子的一些Toeplitz字。因此，我们描述了一个新的家庭的话与一个不寻常的增长的算术复杂性。
英文摘要：
We consider a new family of factorial languages whose subword complexity grows as $Θ(n^α)$, where $α$ is the root of some transcendent equation. Analytical methods and in particular, a corollary of the Wiener-Pitt theorem, are used to find the asymptotic growth of the complexity. Factorial languages considered are languages of arithmetical factors of some Toeplitz words. So, we describe a new family of words with an unusual growth of arithmetical complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
