Pages that link to "Item:Q2635088"

The following pages link to Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088):

Displayed 8 items.

• Necklaces and bracelets in R (Q99679) ‎ (← links)
• A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) ‎ (← links)
• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence (Q1645055) ‎ (← links)
• Classifying rotationally-closed languages having greedy universal cycles (Q1732029) ‎ (← links)
• On greedy algorithms for binary de Bruijn sequences (Q2081554) ‎ (← links)
• Properties of the cycles that contain all vectors of weight \(\le k\) (Q2678985) ‎ (← links)
• Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders (Q5236807) ‎ (← links)
• Constructing the first (and coolest) fixed-content universal cycle (Q6103527) ‎ (← links)