A loopless generation of bitstrings without p consecutive ones
From MaRDI portal
A loopless generation of bitstrings without \(p\) consecutive ones
Recommendations
Cited in
(11)- Strings from linear recurrences and permutations: a gray code
- Gray codes for Fibonacci \(q\)-decreasing words
- Minimal change list for Lucas strings and some graph theoretic consequences
- The coolest way to generate binary strings
- A trace partitioned Gray code forq-ary generalized Fibonacci strings
- Catalan words avoiding pairs of length three patterns
- Loop-free Gray code algorithms for the set of compositions
- Pattern avoiding and q-decreasing binary words
- Dyck paths enumerated by the \(\mathbb{Q}\)-bonacci numbers
- Generating a cyclic 2-Gray code for Lucas words in constant amortized time
- Gray code orders for \(q\)-ary words avoiding a given factor
This page was built for publication: A loopless generation of bitstrings without \(p\) consecutive ones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2752160)