The following pages link to (Q4452089):
Displaying 18 items.
- Generalized algorithm for restricted weak composition generation (Q387319) (← links)
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- Binary bubble languages and cool-lex order (Q645969) (← links)
- Gray codes for signed involutions (Q724881) (← links)
- Gray code orders for \(q\)-ary words avoiding a given factor (Q748433) (← links)
- A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words (Q866549) (← links)
- Gray code for permutations with a fixed number of cycles (Q879329) (← links)
- Gray coding cubic planar maps (Q906395) (← links)
- More restrictive Gray codes for necklaces and Lyndon words (Q963341) (← links)
- A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
- The coolest way to generate combinations (Q1044892) (← links)
- Restricted compositions and permutations: from old to new Gray codes (Q1944104) (← links)
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← links)
- Strings from linear recurrences and permutations: a gray code (Q2089698) (← links)
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) (← links)
- Efficient generation of restricted growth words (Q2444851) (← links)
- Minimal change list for Lucas strings and some graph theoretic consequences (Q2581343) (← links)
- Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
