Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial (Q2915601)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial |
scientific article; zbMATH DE number 6083421
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial |
scientific article; zbMATH DE number 6083421 |
Statements
18 September 2012
0 references
permutation classes
0 references
simple permutations
0 references
automata
0 references
pin words
0 references
algorithm
0 references
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial (English)
0 references
