Words Avoiding Reversed Factors, Revisited

11/26/2019
by   Lukas Fleischer, et al.
0

In 2005, Rampersad and the second author proved a number of theorems about infinite words x with the property that if w is any sufficiently long finite factor of x, then its reversal w^R is not a factor of x. In this note we revisit these results, reproving them in more generality, using machine computations only. Two different techniques are presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/27/2019

Words With Few Palindromes, Revisited

In 2013, Fici and Zamboni proved a number of theorems about finite and i...
research
05/03/2019

Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words

We introduce a variation of the Ziv-Lempel and Crochemore factorizations...
research
09/20/2022

Complement Avoidance in Binary Words

The complement x of a binary word x is obtained by changing each 0 in x ...
research
06/02/2022

On the Lie complexity of Sturmian words

Bell and Shallit recently introduced the Lie complexity of an infinite w...
research
02/07/2021

Lie complexity of words

Given a finite alphabet Σ and a right-infinite word w over Σ, we define ...
research
12/11/2018

On generalized Lyndon words

A generalized lexicographical order on infinite words is defined by choo...
research
12/05/2019

A note on identifiability conditions in confirmatory factor analysis

Recently, Chen, Li and Zhang have established simple conditions characte...

Please sign up or login with your details

Forgot password? Click here to reset