Well quasi-orders and the shuffle closure of finite sets - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2007

Well quasi-orders and the shuffle closure of finite sets

Abstract

Given a set I of words, 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.
Fichier principal
Vignette du fichier
LaRIARR-2006-06.pdf (328.85 Ko) Télécharger le fichier
Loading...

Dates and versions

hal-00085839 , version 1 (15-07-2006)

Identifiers

Cite

Flavio d'Alessandro, Gwenaël Richomme, Stefano Varrichio. Well quasi-orders and the shuffle closure of finite sets. Theoretical Computer Science, 2007, 377, pp.73-92. ⟨hal-00085839⟩
41 View
115 Download

Altmetric

Share

Gmail Facebook X LinkedIn More