More restrictive Gray codes for necklaces and Lyndon words

DOI10.1016/j.ipl.2007.10.011zbMath1186.68349MaRDI QIDQ963341

Vicentiu 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

zbMATH Keywords

combinatorial problems; Lyndon words; necklaces; Gray codes

Mathematics Subject Classification ID

68R15: Combinatorics on words

05A05: Permutations, words, matrices

Related Items

Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions, 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, Inside the binary reflected gray code: flip-swap languages in 2-gray code order, Flip-swap languages in binary reflected Gray code order, Generating fixed density bracelets of arbitrary base

Cites Work

• Gray-ordered binary necklaces
• Gray codes for necklaces
• On binary reflected Gray codes and functions
• Minimal change list for Lucas strings and some graph theoretic consequences
• Generating necklaces
• Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
• A Gray Code for Necklaces of Fixed Density
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item