Words avoiding reversed subwords
Combinatorics
2007-05-23 v1
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.
Cite
@article{arxiv.math/0311121,
title = {Words avoiding reversed subwords},
author = {Narad Rampersad and Jeffrey Shallit},
journal= {arXiv preprint arXiv:math/0311121},
year = {2007}
}
Comments
6 pages