Well-Quasi-Ordering Finite Posets and Formal Languages - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Theory, Series B Année : 1995

Well-Quasi-Ordering Finite Posets and Formal Languages

Résumé

We show that the set of finite posets is a well-quasi-ordering with respect to a certain relation ≤ called chainminor relation. To prove this we introduce a similar relation on finite formal languages which also has this property. As a consequence we get that every property which is hereditary with respect to ≤ has a polynomial test. This test works also on a parallel machine where it runs in constant time with the same costs.
Fichier non déposé

Dates et versions

inria-00549545 , version 1 (22-12-2010)

Identifiants

  • HAL Id : inria-00549545 , version 1

Citer

Jens Gustedt. Well-Quasi-Ordering Finite Posets and Formal Languages. Journal of Combinatorial Theory, Series B, 1995, 65 (1), pp.111--124. ⟨inria-00549545⟩

Collections

TDS-MACS
34 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More