Gray codes for reflectable languages

DOI10.1016/J.IPL.2008.11.007zbMATH Open1191.68396OpenAlexW2100236048MaRDI QIDQ976101FDOQ976101

Authors: Yue Li, Joe Sawada 

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.11.007

Recommendations

• On Generating the N-ary Reflected Gray Codes
• More restrictive Gray codes for necklaces and Lyndon words
• More restricted growth functions: Gray codes and exhaustive generation
• scientific article
• Gray codes for reflection groups

zbMATH Keywords

analysis of algorithmscombinatorial problemsdesign of algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics in computer science (68R05) Analysis of algorithms (68W40)

Cites Work

• On the loopless generation of binary tree sequences
• Enumerating, Ranking and Unranking Binary Trees
• A Survey of Combinatorial Gray Codes
• A Loopless Gray-Code Algorithm for Listing k-ary Trees
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Title not available (Why is that?)
• Gray codes for \(A\)-free strings
• A fast algorithm to generate open meandric systems and meanders
• Algorithms – ESA 2005

Cited In (7)

• Combinatorial generation via permutation languages. I. Fundamentals
• Binary bubble languages and cool-lex order
• Flip-swap languages in binary reflected Gray code order
• Generating cyclic rotation Gray codes for stamp foldings and semi-meanders
• Gray code orders for \(q\)-ary words avoiding a given factor
• Generating Gray codes for weak orders in constant amortized time
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order

This page was built for publication: Gray codes for reflectable languages

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