Exhaustive generation for permutations avoiding (colored) regular sets of patterns (Q2274076)
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: Exhaustive generation for permutations avoiding (colored) regular sets of patterns |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exhaustive generation for permutations avoiding (colored) regular sets of patterns |
scientific article |
Statements
Exhaustive generation for permutations avoiding (colored) regular sets of patterns (English)
0 references
19 September 2019
0 references
pattern avoiding permutation
0 references
right-justified forbidden pattern
0 references
exhaustive generating algorithm
0 references
succession function
0 references
ECO method
0 references
0.8083520531654358
0 references
0.8027430772781372
0 references
0.7998427152633667
0 references
0.7731270790100098
0 references
