More restrictive Gray codes for necklaces and Lyndon words
From MaRDI portal
Publication:963341
DOI10.1016/J.IPL.2007.10.011zbMATH Open1186.68349OpenAlexW2026037103MaRDI QIDQ963341FDOQ963341
Authors: Vincent Vajnovszki 
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.10.011
Recommendations
Cites Work
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- A Gray Code for Necklaces of Fixed Density
- Title not available (Why is that?)
- Gray codes for necklaces
- Gray codes for necklaces and Lyndon words of arbitrary base
- Generating necklaces
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
- Title not available (Why is that?)
- Gray-ordered binary necklaces
- On binary reflected Gray codes and functions
- Minimal change list for Lucas strings and some graph theoretic consequences
- Title not available (Why is that?)
Cited In (13)
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Gray-ordered binary necklaces
- Flip-swap languages in binary reflected Gray code order
- Gray codes for necklaces and Lyndon words of arbitrary base
- Gray codes and overlap cycles for restricted weight words
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
- Title not available (Why is that?)
- Gray code orders for \(q\)-ary words avoiding a given factor
- Gray codes for reflectable languages
- Generating fixed density bracelets of arbitrary base
- Title not available (Why is that?)
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
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)
