 |
 |
|
|
| HAL: inria-00549545, version 1 |
| See detailed view |  BibTeX,EndNote,... |
 |
| Journal of Combinatorial Theory, Series B 65, 1 (1995) 111--124 |
|
|
|
|
| Well-Quasi-Ordering Finite Posets and Formal Languages |
|
|
| Jens Gustedt 1 |
|
|
| (1995) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Technische Universität Berlin (TUB) |
|
|
|
Technische Universität Berlin |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Discrete Mathematics Mathematics/Combinatorics |
| inria-00549545, version 1 | |
| http://hal.inria.fr/inria-00549545 | |
| oai:hal.inria.fr:inria-00549545 | |
| From: Jens Gustedt | |
| Submitted on: Wednesday, 22 December 2010 10:45:15 | |
| Updated on: Wednesday, 22 December 2010 10:45:15 | |
