Flip-swap languages in binary reflected Gray code order

DOI10.1016/j.tcs.2022.08.024OpenAlexW4294770181MaRDI QIDQ2676472

Aaron Williams, Dennis Wong, Joe Sawada

Publication date: 27 September 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.08.024

zbMATH Keywords

Lyndon wordsnecklacesGray codesDyck wordsbinary reflected Gray codeflip-swap languageBRGC

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

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

• An Eades-McKay algorithm for well-formed parentheses strings
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• The coolest way to generate binary strings
• Binary bubble languages and cool-lex order
• Gray code orders for \(q\)-ary words avoiding a given factor
• A universal cycle for strings with fixed-content (which are also known as multiset permutations)
• 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
• The coolest way to generate combinations
• 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
• Cool-lex order and \(k\)-ary Catalan structures
• Restricted compositions and permutations: from old to new Gray codes
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order
• A shift Gray code for fixed-content Łukasiewicz words
• 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
• A Survey of Combinatorial Gray Codes
• Matters Computational
• Combinatorial generation via permutation languages
• Distance-2 Cyclic Chaining of Constant-Weight Codes
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Flip-swap languages in binary reflected Gray code order