A finite word poset : In honor of Aviezri Fraenkel on the occasion of his 70th birthday

Our word posets have �nite words of bounded length as their elements, with the words composed from a �nite alphabet. Their partial ordering follows from the inclusion of a word as a subsequence of another word. The elemental combinatorial properties of such posets are established. Their automorphism groups are determined (along with similar result for the word poset studied by Burosch, Frank and R¨ohl [4]) and a BLYM inequality is veri�ed (via the normalized matching property)