Pages that link to "Item:Q1232525"
From MaRDI portal
The following pages link to Lexicographic compositions and de Bruijn sequences (Q1232525):
Displaying 9 items.
- Combinatorics of Boolean automata circuits dynamics (Q412329) (← links)
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective (Q494067) (← links)
- A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
- On the de Bruijn torus problem (Q690027) (← links)
- A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
- An algorithm for generating necklaces of beads in two colors (Q1084396) (← links)
- Generation of some de Bruijn sequences (Q1144586) (← links)
- Necklaces of beads in k colors and k-ary de Bruijn sequences (Q1248514) (← links)
- An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) (← links)
