The following pages link to Generating necklaces (Q4020354):
Displaying 29 items.
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time (Q391391) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- The coolest way to generate binary strings (Q489746) (← links)
- On prefix normal words and prefix normal forms (Q729994) (← links)
- Constructing new covering arrays from LFSR sequences over finite fields (Q897312) (← links)
- More restrictive Gray codes for necklaces and Lyndon words (Q963341) (← links)
- de Bruijn sequences and de Bruijn graphs for a general language (Q1044740) (← links)
- Minimum Eulerian circuits and minimum de Bruijn sequences (Q1044891) (← links)
- Average cost of Duval's algorithm for generating Lyndon words (Q1334678) (← links)
- An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) (← links)
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence (Q1645055) (← links)
- Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← links)
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order (Q1679610) (← links)
- \(k\)-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials (Q1693363) (← links)
- Enumerating words with forbidden factors (Q1739941) (← links)
- Gray cycles of maximum length related to \(k\)-character substitutions (Q2096591) (← links)
- A characterization of binary morphisms generating Lyndon infinite words (Q2140469) (← links)
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence (Q2279980) (← links)
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
- Generalized de Bruijn words for primitive words and powers (Q2515571) (← links)
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088) (← links)
- Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) (← links)
- Generating fixed density bracelets of arbitrary base (Q2875290) (← links)
- De Bruijn Sequences for the Binary Strings with Maximum Density (Q3078396) (← links)
- SYMMETRIC ITINERARY SETS: ALGORITHMS AND NONLINEAR EXAMPLES (Q4968464) (← links)
- Completely uniformly distributed sequences based on de Bruijn sequences (Q5113681) (← links)
- (Q5855731) (← links)
- On infinite prefix normal words (Q5919082) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
