A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
From MaRDI portal
Publication:391391
DOI10.1016/J.TCS.2012.01.013zbMATH Open1296.68120OpenAlexW2040262311MaRDI QIDQ391391FDOQ391391
Authors: Joe Sawada, A. Williams 
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.013
Recommendations
Lyndon wordGray codecool-lex orderfixed-density de Bruijn sequencefixed-density necklacepseudo-necklace
Cites Work
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- Factorizing words over an ordered alphabet
- Title not available (Why is that?)
- A Gray Code for Necklaces of Fixed Density
- Symmetry types of periodic sequences
- An algorithm for generating necklaces of beads in two colors
- Gray codes for necklaces
- De Bruijn sequences for fixed-weight binary strings
- Gray codes for necklaces and Lyndon words of arbitrary base
- Generating necklaces
- Efficient oracles for generating binary bubble languages
- Title not available (Why is that?)
- Binary bubble languages and cool-lex order
- Gray-ordered binary necklaces
- More restrictive Gray codes for necklaces and Lyndon words
Cited In (18)
- Many body density of states of a system of non interacting spinless fermions
- Cool-lex order and \(k\)-ary Catalan structures
- Binary bubble languages and cool-lex order
- Flip-swap languages in binary reflected Gray code order
- Counting the decimation classes of binary vectors with relatively prime length and density
- Gray codes for necklaces and Lyndon words of arbitrary base
- Constructing the first (and coolest) fixed-content universal cycle
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- Polytopes associated with symmetry handling
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
- De Bruijn sequences for the binary strings with maximum density
- Successor rules for flipping pancakes and burnt pancakes
- A Legendre pair of length 77 using complementary binary matrices with fixed marginals
- Ranking and unranking fixed-density necklaces and Lyndon words
- Finding the largest fixed-density necklace and Lyndon word
- The coolest way to generate binary strings
- Generating 2-Gray codes for ballot sequences in constant amortized time
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
This page was built for publication: A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391391)
