The following pages link to Daniel Gabric (Q1659977):
Displaying 14 items.
- Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← links)
- A de Bruijn sequence construction by concatenating cycles of the complemented cycling register (Q1678337) (← links)
- A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
- Investigating the discrepancy property of de Bruijn sequences (Q2075526) (← links)
- Maximal state complexity and generalized de Bruijn words (Q2113383) (← links)
- Words that almost commute (Q2138989) (← links)
- Generalized de Bruijn words and the state complexity of conjugate sets (Q2179333) (← links)
- Avoidance of split overlaps (Q2214038) (← links)
- Borders, palindrome prefixes, and square prefixes (Q2224845) (← links)
- Circularly squarefree words and unbordered conjugates: a new approach (Q2333036) (← links)
- The simplest binary word with only three squares (Q5021107) (← links)
- Ranking and unranking bordered and unbordered words (Q6121434) (← links)
- An Inequality for the Number of Periods in a Word (Q6169892) (← links)
- Mutual Borders and Overlaps (Q6195715) (← links)
