The coolest way to generate binary strings
From MaRDI portal
Publication:489746
DOI10.1007/s00224-013-9486-8zbMath1303.68165OpenAlexW2006913132MaRDI QIDQ489746
Publication date: 21 January 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9486-8
Hamming distanceGray codede Bruijn sequencecombinatorics on wordsbinary stringscool-lex orderFKM algorithmuniversal cycleLevenshtein distancenecklace prefix algorithm
Related Items
Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Computing generalized de Bruijn sequences ⋮ Flip-swap languages in binary reflected Gray code order ⋮ On universal partial words ⋮ Successor rules for flipping pancakes and burnt pancakes ⋮ Trimming and gluing Gray codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Efficient oracles for generating binary bubble languages
- Long cycles in the middle two layers of the discrete cube
- Binary bubble languages and cool-lex order
- On the de Bruijn torus problem
- The origins of combinatorics on words
- The coolest way to generate combinations
- An algorithm for generating subsets of fixed size with a strong minimal change property
- An algorithm for generating necklaces of beads in two colors
- Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length)
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Monotone Gray codes and the middle levels problem
- Cool-lex order and \(k\)-ary Catalan structures
- De Bruijn Sequences for Fixed-Weight Binary Strings
- De Bruijn Sequences for the Binary Strings with Maximum Density
- Generating necklaces
- A problem in arrangements
- Adjacent interchange generation of combinations
This page was built for publication: The coolest way to generate binary strings
