The following pages link to (Q4085749):
Displaying 15 items.
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- On minimal Sturmian partial words (Q534335) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Computing generalized de Bruijn sequences (Q1680534) (← links)
- Quantifying local randomness in human DNA and RNA sequences using Erdös motifs (Q1716870) (← links)
- Maximal state complexity and generalized de Bruijn words (Q2113383) (← links)
- Avoidance of split overlaps (Q2214038) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- An unoriented variation on de Bruijn sequences (Q2409522) (← links)
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088) (← links)
- De Bruijn Sequences for the Binary Strings with Maximum Density (Q3078396) (← links)
- Containing All Permutations (Q5144492) (← links)
- Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders (Q5236807) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
