Computer Science – Discrete Mathematics
Scientific paper
2006-07-18
Computer Science
Discrete Mathematics
Scientific paper
Given a set I of word, the set of all words obtained by the shuffle of
(copies of) words of I is naturally provided with a partial order. In [FS05],
the authors have opened the problem of the characterization of the finite sets
I such that the order is a well quasi-order . In this paper we give an answer
in the case when I consists of a single word w.
D'Alessandro Flavio
Richomme Gwénaël
Varrichio Stefano
No associations
LandOfFree
Well quasi-orders and the shuffle closure of finite sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Well quasi-orders and the shuffle closure of finite sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Well quasi-orders and the shuffle closure of finite sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-121429