Inside the binary reflected gray code: flip-swap languages in 2-gray code order

DOI10.1007/978-3-030-85088-3_15OpenAlexW3201573568MaRDI QIDQ2140470

Aaron Williams, Joe Sawada, Dennis Wong

Publication date: 20 May 2022

Full work available at URL: https://arxiv.org/abs/2105.03556

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

Gray codes for Fibonacci \(q\)-decreasing words ⋮ Flip-swap languages in binary reflected Gray code order ⋮ Generating cyclic rotation Gray codes for stamp foldings and semi-meanders ⋮ Generating 2-Gray codes for ballot sequences in constant amortized time

Uses Software

• FXT
• hfloat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Eades-McKay algorithm for well-formed parentheses strings
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• Binary bubble languages and cool-lex order
• A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
• More restrictive Gray codes for necklaces and Lyndon words
• Gray codes for reflectable languages
• Lexicographically least circular substrings
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
• Exhaustive generation of combinatorial objects by ECO
• Proof of the middle levels conjecture
• The Greedy Gray Code Algorithm
• Clustered Integer 3SUM via Additive Combinatorics
• Factorizing words over an ordered alphabet
• Generating binary trees by transpositions
• Matters Computational
• Combinatorial generation via permutation languages
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: Inside the binary reflected gray code: flip-swap languages in 2-gray code order