A note on antichains of words (Q1909962)

Summary: We can compress the word `banana' as \(xyyz\), where \(x=\)`\(b\)', \(y=\)`\(an\)', \(z=\) `\(a\)'. We say that `banana' encounters \(yy\). Thus a `codes', version of \(yy\) shows up in `banana'. The relation `\(u\) encounters \(w\)' is transitive, and thus generates an order on words. We study antichains under this order. In particular, we show that in this order there is an infinite antichain of binary words avoiding overlaps.