Pages that link to "Item:Q685313"
From MaRDI portal
The following pages link to The distribution of subword counts is usually normal (Q685313):
Displaying 11 items.
- Multiple pattern matching: a Markov chain approach (Q938109) (← links)
- On the number of occurrences of a symbol in words of regular languages. (Q1401339) (← links)
- A unified approach to word occurrence probabilities (Q1585335) (← links)
- Motif statistics. (Q1853502) (← links)
- Successions in words and compositions (Q1928592) (← links)
- Hidden words statistics for large patterns (Q2030762) (← links)
- Stochastic analysis of minimal automata growth for generalized strings (Q2176399) (← links)
- Variances and covariances in the central limit theorem for the output of a transducer (Q2349966) (← links)
- A survey of temporal data mining (Q2371224) (← links)
- Approximation of sojourn-times via maximal couplings: motif frequency distributions (Q2510394) (← links)
- Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations (Q6068845) (← links)
