Gray codes for reflectable languages

DOI10.1016/j.ipl.2008.11.007zbMath1191.68396OpenAlexW2100236048MaRDI QIDQ976101

Joe Sawada, Yue Li

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

combinatorial problemsanalysis of algorithmsdesign of algorithms

Mathematics Subject Classification ID

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

Related Items (7)

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

Cites Work

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

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