Pages that link to "Item:Q3189073"
From MaRDI portal
The following pages link to Counting occurrences for a finite set of words (Q3189073):
Displaying 6 items.
- Asymptotic normality and strong consistency of maximum quasi-likelihood estimates in generalized linear models (Q854640) (← links)
- A generalized Goulden-Jackson cluster method and lattice path enumeration (Q1685986) (← links)
- On cyclic strings avoiding a pattern (Q1744751) (← links)
- An application of the Goulden-Jackson cluster theorem (Q2109221) (← links)
- (Q5494789) (← links)
- The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis (Q6599787) (← links)