WinnSpace Repository

A Note on Antichains of Words

Show simple item record

dc.contributor.author Currie, James D.
dc.date.accessioned 2018-01-15T20:35:40Z
dc.date.available 2018-01-15T20:35:40Z
dc.date.issued 1995-10-14
dc.identifier.citation James D. Currie,“A Note on Antichains of Words”,Electronic Journal of Combinatorics 2 (1995),http://www.combinatorics.org/Volume_2/Abstracts/v2i1r21.html en_US
dc.identifier.issn 1077-8926
dc.identifier.uri http://hdl.handle.net/10680/1349
dc.description.abstract 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 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. en_US
dc.language.iso en en_US
dc.publisher The Electronic Journal of Combinatorics en_US
dc.subject overlaps. antichains, words avoiding patterns en_US
dc.title A Note on Antichains of Words en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search WinnSpace


Browse

My Account