Words Avoiding Reversed Factors, Revisited

TL;DR

This paper revisits and generalizes previous theorems on infinite words avoiding reversed factors, using computational methods and presenting two different proof techniques.

Contribution

It extends earlier results on words avoiding reversed factors by providing more general proofs based solely on machine computations.

Findings

Reproved previous theorems in more general settings

Introduced two distinct computational proof techniques

Enhanced understanding of infinite words avoiding reversed factors

Abstract

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.