an:06951201
Zbl 1408.68124
Kotlyarov, N. V.
Existence of words over three-letter alphabet not containing squares with replacement errors
EN
Mosc. Univ. Math. Bull. 73, No. 3, 90-97 (2018); translation from Vestn. Mosk. Univ., Ser. I 73, No. 3, 8-16 (2018).
00412409
2018
j
68R15
avoidable pattern; factor; square with error
The paper deals with a variant of avoidability of patterns in infinite words. The way the author deals with the basic terms is rather strange. He defines a well-established term, ``factor'', as a fragment of a word, where his term ``fragment'' (undefined in the paper) seems to mean the common term ``occurrence of the factor''. He makes the things even more obscure by stating that ``factors can be represented in two ways, as word fragments, or as words''. This makes reading the paper rather difficult.
The author investigates avoidability of square factors with errors. He defines that an infinite word has the property \(\binom{\Delta}{p}\) if it does not contain factors of the form \(uv\), where \(|u|=|v| >p\geq0\) and \(v\) differs from \(u\) in at most \(\Delta\geq0\) letter positions (contains at most \(\Delta\) errors). The result of the paper states that for any \(\Delta\geq0\) there exists an infinite word over a three-letter alphabet possessing the property \(\binom{\Delta}{\Delta}\).
Anton ??ern?? (Safat)