An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 07:28, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for deciding the finiteness of the number of simple permutations in permutation classes |
scientific article |
Statements
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (English)
0 references
6 February 2015
0 references
permutation class
0 references
finite basis
0 references
simple permutation
0 references
automaton
0 references
pin-permutation
0 references