A Finite Word Poset
Keyword(s):
Our word posets have finite words of bounded length as their elements, with the words composed from a finite 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öhl [4]) and a BLYM inequality is verified (via the normalized matching property).
1979 ◽
Vol 31
(1)
◽
pp. 112-123
◽
Keyword(s):
2001 ◽
Vol 64
(2)
◽
pp. 257-272
◽
Keyword(s):
2004 ◽
Vol 15
(02)
◽
pp. 355-383
◽
Keyword(s):
Keyword(s):