More restrictive Gray codes for necklaces and Lyndon words
From MaRDI portal
Publication:963341
Recommendations
Cites work
- scientific article; zbMATH DE number 1696649 (Why is no real title available?)
- scientific article; zbMATH DE number 2040940 (Why is no real title available?)
- scientific article; zbMATH DE number 5279410 (Why is no real title available?)
- A Gray Code for Necklaces of Fixed Density
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
- Generating necklaces
- Gray codes for necklaces
- Gray codes for necklaces and Lyndon words of arbitrary base
- Gray-ordered binary necklaces
- Minimal change list for Lucas strings and some graph theoretic consequences
- On binary reflected Gray codes and functions
Cited in
(13)- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
- Gray codes for necklaces and Lyndon words of arbitrary base
- Gray codes for reflectable languages
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
- Gray code orders for \(q\)-ary words avoiding a given factor
- Gray-ordered binary necklaces
- scientific article; zbMATH DE number 4102988 (Why is no real title available?)
- Gray codes and overlap cycles for restricted weight words
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- Flip-swap languages in binary reflected Gray code order
- scientific article; zbMATH DE number 5279410 (Why is no real title available?)
- Generating fixed density bracelets of arbitrary base
This page was built for publication: More restrictive Gray codes for necklaces and Lyndon words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963341)
