Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155)
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: Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences |
scientific article; zbMATH DE number 6723740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences |
scientific article; zbMATH DE number 6723740 |
Statements
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (English)
0 references
29 May 2017
0 references
necklace
0 references
Lyndon word
0 references
de Bruijn sequence
0 references
ranking
0 references
unranking
0 references
0 references
0 references
0 references
0.8867171406745911
0 references
0.8524259328842163
0 references
0.8410243391990662
0 references
0.8107516765594482
0 references
