Pages that link to "Item:Q2272399"
From MaRDI portal
The following pages link to Ranking and unranking fixed-density necklaces and Lyndon words (Q2272399):
Displaying 9 items.
- Closure and nonclosure properties of the classes of compressible and rankable sets (Q2037201) (← links)
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
- Finding the largest fixed-density necklace and Lyndon word (Q2628279) (← links)
- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence (Q2830442) (← links)
- A dynamical approach to necklaces and words (Q2906386) (← links)
- (Q3631214) (← links)
- Ranking and unranking bordered and unbordered words (Q6121434) (← links)
- Ranking and Unranking k-Subsequence Universal Words (Q6134861) (← links)
- Cut-down de Bruijn sequences (Q6635080) (← links)