Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
On the 2-binomial complexity of the generalized Thue–Morse words
XT Lü, J Chen, ZX Wen, W Wu - Theoretical Computer Science, 2024 - Elsevier
In this paper, we study the 2-binomial complexity btm, 2 (n) of the generalized Thue–Morse
words tm over the alphabet {0, 1,…, m− 1} for every integer m≥ 3. By using boundary words …
words tm over the alphabet {0, 1,…, m− 1} for every integer m≥ 3. By using boundary words …
Abelian closures of infinite binary words
Two finite words u and v are called Abelian equivalent if each letter occurs equally many
times in both u and v. The abelian closure A (x) of (the shift orbit closure of) an infinite word x …
times in both u and v. The abelian closure A (x) of (the shift orbit closure of) an infinite word x …
On -abelian Equivalence and Generalized Lagrange Spectra
We study the set of $ k $-abelian critical exponents of all Sturmian words. It has been proven
that in the case $ k= 1$ this set coincides with the Lagrange spectrum. Thus the sets …
that in the case $ k= 1$ this set coincides with the Lagrange spectrum. Thus the sets …
All growth rates of abelian exponents are attained by infinite binary words
We consider repetitions in infinite words by making a novel inquiry to the maximum eventual
growth rate of the exponents of abelian powers occurring in an infinite word. Given an …
growth rate of the exponents of abelian powers occurring in an infinite word. Given an …