Pages that link to "Item:Q1422149"
From MaRDI portal
The following pages link to Strings with maximally many distinct subsequences and substrings (Q1422149):
Displaying 8 items.
- On average sequence complexity (Q703547) (← links)
- On extending de Bruijn sequences (Q1944170) (← links)
- Maximal state complexity and generalized de Bruijn words (Q2113383) (← links)
- Finding binary words with a given number of subsequences (Q2136284) (← links)
- Algorithms for subsequence combinatorics (Q2378518) (← links)
- Test sequence construction using minimum information on the tested system (Q2498283) (← links)
- Diagonal Asymptotics for Products of Combinatorial Classes (Q5364225) (← links)
- Subsequence frequency in binary words (Q6204345) (← links)
