Flip-swap languages in binary reflected Gray code order
From MaRDI portal
Recommendations
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
- Gray codes for reflectable languages
- More restrictive Gray codes for necklaces and Lyndon words
- Binary bubble languages and cool-lex order
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
Cites work
- scientific article; zbMATH DE number 1696649 (Why is no real title available?)
- scientific article; zbMATH DE number 5596834 (Why is no real title available?)
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 2040940 (Why is no real title available?)
- scientific article; zbMATH DE number 1522933 (Why is no real title available?)
- scientific article; zbMATH DE number 7051269 (Why is no real title available?)
- scientific article; zbMATH DE number 5279410 (Why is no real title available?)
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- A Survey of Combinatorial Gray Codes
- A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
- A shift Gray code for fixed-content Łukasiewicz words
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
- A universal cycle for strings with fixed-content (which are also known as multiset permutations)
- An Eades-McKay algorithm for well-formed parentheses strings
- Binary bubble languages and cool-lex order
- Clustered Integer 3SUM via Additive Combinatorics
- Combinatorial generation via permutation languages
- Cool-lex order and k-ary Catalan structures
- Distance-2 Cyclic Chaining of Constant-Weight Codes
- Exhaustive generation of combinatorial objects by ECO
- Factorizing words over an ordered alphabet
- Generating binary trees by transpositions
- Gray code orders for \(q\)-ary words avoiding a given factor
- Gray codes for reflectable languages
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
- Lexicographically least circular substrings
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Matters computational. Ideas, algorithms, source code.
- More restrictive Gray codes for necklaces and Lyndon words
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
- Proof of the middle levels conjecture
- Restricted compositions and permutations: from old to new Gray codes
- The coolest way to generate binary strings
- The coolest way to generate combinations
- The greedy Gray code algorithm
Cited in
(6)- Generating cyclic 2-Gray codes for Fibonacci \(q\)-decreasing words
- Maximize the rightmost digit: Gray codes for restricted growth strings
- Greedy Gray codes for Dyck words and ballot sequences
- Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders
- Generating cyclic rotation Gray codes for stamp foldings and semi-meanders
- Generating 2-Gray codes for ballot sequences in constant amortized time
This page was built for publication: Flip-swap languages in binary reflected Gray code order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676472)
