The following pages link to On extending de Bruijn sequences (Q1944170):
Displayed 12 items.
- Initial non-repetitive complexity of infinite words (Q284845) (← links)
- Perfect necklaces (Q308973) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- Uniformly de Bruijn sequences and symbolic Diophantine approximation on fractals (Q1653311) (← links)
- On semi-perfect de Bruijn words (Q1704583) (← links)
- Some negative results related to Poissonian pair correlation problems (Q2279979) (← links)
- Low discrepancy sequences failing Poissonian pair correlations (Q2311093) (← links)
- Extending de Bruijn sequences to larger alphabets (Q2656349) (← links)
- Designing preference functions for de Bruijn sequences with forbidden words (Q2673980) (← links)
- Normal Numbers and Computer Science (Q4613551) (← links)
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers (Q4645117) (← links)
- A construction of a 𝜆-Poisson generic sequence (Q5879128) (← links)