The following pages link to Hidden word statistics (Q3546297):
Displayed 12 items.
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern (Q544885) (← links)
- Multiple pattern matching: a Markov chain approach (Q938109) (← links)
- \(t\)-wise independence with local dependencies (Q963369) (← links)
- Renewal theory for asymmetric \(U\)-statistics (Q1722026) (← links)
- Weighted dependency graphs (Q1990226) (← links)
- Stochastic analysis of minimal automata growth for generalized strings (Q2176399) (← links)
- Central limit theorems for patterns in multiset permutations and set partitions (Q2180386) (← links)
- Variances and covariances in the central limit theorem for the output of a transducer (Q2349966) (← links)
- Avoiding cross-bifix-free binary words (Q2377303) (← links)
- Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations (Q6068845) (← links)
- Asymptotic normality for the size of graph tries built from M-ary tree labelings (Q6132968) (← links)
- Local limit laws for symbol statistics in bicomponent rational models (Q6168079) (← links)