Words avoiding reversed subwords

Abstract

We examine words w satisfying the following property: if x is a subword of w and |x| is at least k for some fixed k, then the reversal of x is not a subword of w.

6 pages

Cited by in corpus (4)

• On the least number of palindromes contained in an infinite word
• A note on the avoidability of binary patterns with variables and reversals
• Growth rate of binary words avoiding $xx{x}^R$
• Periodicity, repetitions, and orbits of an automatic sequence