Gray codes for reflectable languages

DOI10.1016/J.IPL.2008.11.007MaRDI QIDQ976101zbMATH OpenOpenAlexFDO

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

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)

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; zbMATH DE number 4139306
• Gray codes for reflection groups

Cites work

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

Cited in

(8)

• Binary bubble languages and cool-lex order
• Flip-swap languages in binary reflected Gray code order
• Combinatorial generation via permutation languages. I: Fundamentals
• Generating cyclic rotation Gray codes for stamp foldings and semi-meanders
• Gray code orders for \(q\)-ary words avoiding a given factor
• A Gray code for a regular language
• 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)