Generating necklaces and strings with forbidden substrings

DOI10.1007/3-540-44968-X_33MaRDI QIDQ2766842zbMATH OpenFDO

Authors Frank Ruskey, Joe Sawada

Publication date 22 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44968-X_33

Mathematics Subject Classification ID

Combinatorics on words (68R15) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1445312
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• scientific article; zbMATH DE number 1305469
• Generating necklaces
• On cyclic strings avoiding a pattern

Cited in

(10)

• de Bruijn sequences and de Bruijn graphs for a general language
• Minimum Eulerian circuits and minimum de Bruijn sequences
• A fast algorithm to generate necklaces with fixed content
• Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices
• Flip-swap languages in binary reflected Gray code order
• The k-centre problem for classes of cyclic words
• Enumerating \(m\)-length walks in directed graphs with constant delay
• Listing words in free groups
• More restrictive Gray codes for necklaces and Lyndon words
• A note on certain de Bruijn sequences with forbidden subsequences

This page was built for publication: Generating necklaces and strings with forbidden substrings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766842)