2019/11/26 by Fleischer, Lukas, Shallit, Jeffrey
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL)
paper · doi:10.48550/arxiv.1911.11704
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 wR 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.