Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence (Q2830442)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6645260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence |
scientific article; zbMATH DE number 6645260 |
Statements
28 October 2016
0 references
Lyndon word
0 references
de Bruijn sequence
0 references
necklaces
0 references
deterministic finite automaton
0 references
efficient algorithm
0 references
0 references
0 references
Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence (English)
0 references
0.9274105429649352
0 references
0.8524259328842163
0 references
0.8021495342254639
0 references
0.7732530236244202
0 references
0.7717930674552917
0 references
