Pages that link to "Item:Q423901"
From MaRDI portal
The following pages link to Spans of preference functions for de Bruijn sequences (Q423901):
Displaying 11 items.
- A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
- An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) (← links)
- Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← links)
- Mapping prefer-opposite to prefer-one de Bruijn sequences (Q1675290) (← links)
- A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
- On greedy algorithms for binary de Bruijn sequences (Q2081554) (← links)
- Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions (Q2220830) (← links)
- Designing preference functions for de Bruijn sequences with forbidden words (Q2673980) (← links)
- A relation between sequences generated by Golomb's preference algorithm (Q2678989) (← links)
- On the quadratic spans of DeBruijn sequences (Q3487281) (← links)
- Linear spans of modified de Bruijn sequences (Q3986489) (← links)
