Gray codes for necklaces and Lyndon words of arbitrary base

MaRDI QIDQ3077264zbMATH OpenFDO

Authors Mark Weston, Vincent Vajnovszki

Publication date 22 February 2011

zbMATH Keywords

Gray codeunrestricted binary necklaces

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Eulerian and Hamiltonian graphs (05C45) Combinatorics on words (68R15)

Recommendations

• More restrictive Gray codes for necklaces and Lyndon words
• Gray codes for necklaces
• A Gray Code for Necklaces of Fixed Density
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time

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
• On cardinalities of \(k\)-abelian equivalence classes
• A fast algorithm to generate Beckett-Gray codes
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
• Gray code orders for \(q\)-ary words avoiding a given factor
• scientific article; zbMATH DE number 826073 (Why is no real title available?)
• Gray visiting Motzkins
• Necklaces and slimes
• Combinatorial Gray codes for classes of pattern avoiding permutations
• scientific article; zbMATH DE number 5279410 (Why is no real title available?)

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)