Well-Quasi-Ordering Finite Posets and Formal Languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Combinatorial Theory, Series B Year : 1995

Well-Quasi-Ordering Finite Posets and Formal Languages

Abstract

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.
Not file

Dates and versions

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

Identifiers

  • HAL Id : inria-00549545 , version 1

Cite

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

INSMI TDS-MACS
34 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More