Now showing items 1-1 of 1
A Note on Antichains of Words
(The Electronic Journal of Combinatorics, 1995-10-14)
We can compress the word 'banana' as xyyz, where x= 'b', y= 'an',z= 'a'. We say that 'banana' encounters yy. Thus a 'coded' version of yy shows up in 'banana'. The relation 'u encounters w' is transitive, and thus generates ...