Gray codes for necklaces and Lyndon words of arbitrary base
From MaRDI portal
Publication:3077264
zbMATH Open1224.68070MaRDI QIDQ3077264FDOQ3077264
Authors: Mark Weston, Vincent Vajnovszki 
Publication date: 22 February 2011
Recommendations
Enumerative combinatorics (05A99) Eulerian and Hamiltonian graphs (05C45) Combinatorics on words (68R15)
Cited In (16)
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Gray-ordered binary necklaces
- More restrictive Gray codes for necklaces and Lyndon words
- On the generation of aperiodic and periodic necklaces via T-augmentation
- Loopless Gray code enumeration and the Tower of Bucharest
- Loopless Gray code enumeration and the Tower of Bucharest
- Gray codes and overlap cycles for restricted weight words
- A fast algorithm to generate Beckett-Gray codes
- On cardinalities of \(k\)-abelian equivalence classes
- 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 visiting Motzkins
- Necklaces and slimes
- Combinatorial Gray codes for classes of pattern avoiding permutations
- Title not available (Why is that?)
This page was built for publication: Gray codes for necklaces and Lyndon words of arbitrary base
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077264)
