Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
On minimal critical exponent of balanced sequences
We study the threshold between avoidable and unavoidable repetitions in infinite balanced
sequences over finite alphabets. The conjecture stated by Rampersad, Shallit and …
sequences over finite alphabets. The conjecture stated by Rampersad, Shallit and …
[PDF][PDF] Properties of a ternary infinite word
We study the properties of the ternary infinite wordp= 012102101021012101021012⋯, that
is, the fixed point of the map h: 0→ 01, 1→ 21, 2→ 0. We determine its factor complexity …
is, the fixed point of the map h: 0→ 01, 1→ 21, 2→ 0. We determine its factor complexity …
Automatic sequences in negative bases and proofs of some conjectures of Shevelev
We discuss the use of negative bases in automatic sequences. Recently the theorem-prover
Walnut has been extended to allow the use of base (—k) to express variables, thus …
Walnut has been extended to allow the use of base (—k) to express variables, thus …
Power-free complementary binary morphisms
We revisit the topic of power-free morphisms, focusing on the properties of the class of
complementary morphisms. Such morphisms are defined over a 2-letter alphabet, and map …
complementary morphisms. Such morphisms are defined over a 2-letter alphabet, and map …
Frequency-constrained substring complexity
We introduce the notion of frequency-constrained substring complexity. For any finite string,
it counts the distinct substrings of the string per length and frequency class. For a string x of …
it counts the distinct substrings of the string per length and frequency class. For a string x of …
On balanced sequences and their asymptotic critical exponent
We study aperiodic balanced sequences over finite alphabets. A sequence vv of this type is
fully characterised by a Sturmian sequence uu and two constant gap sequences yy and …
fully characterised by a Sturmian sequence uu and two constant gap sequences yy and …
Transition property for cube-free words
We study cube-free words over arbitrary non-unary finite alphabets and prove the following
structural property: for every pair (u, v) of d-ary cube-free words, if u can be infinitely …
structural property: for every pair (u, v) of d-ary cube-free words, if u can be infinitely …
Abelian repetition threshold revisited
In combinatorics on words, repetition thresholds are the numbers separating avoidable and
unavoidable repetitions of a given type in a given class of words. For example, the meaning …
unavoidable repetitions of a given type in a given class of words. For example, the meaning …
Avoiding square-free words on free groups
We consider sets of factors that can be avoided in square-free words on two-generator free
groups. The elements of the group are presented in terms of {0, 1, 2, 3} such that 0 and 2 …
groups. The elements of the group are presented in terms of {0, 1, 2, 3} such that 0 and 2 …
Transition Property for-Power Free Languages with and Letters
J Rukavicka - … Conference on Developments in Language Theory, 2020 - Springer
Abstract In 1985, Restivo and Salemi presented a list of five problems concerning power free
languages. Problem 4 states: Given α-power-free words u and v, decide whether there is a …
languages. Problem 4 states: Given α-power-free words u and v, decide whether there is a …