Words Avoiding Reversed Factors, Revisited
Formal Languages and Automata Theory
2019-12-10 v2 Discrete Mathematics
Combinatorics
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.
Cite
@article{arxiv.1911.11704,
title = {Words Avoiding Reversed Factors, Revisited},
author = {Lukas Fleischer and Jeffrey Shallit},
journal= {arXiv preprint arXiv:1911.11704},
year = {2019}
}