1 problem

Let $P$ be a poset and let $P^*$ be the Kleene closure of the alphabet consisting of the elements of $P$, ordered by generalized subword order: $u\leq w$ when a subword…