Hidden word statistics
From MaRDI portal
Recommendations
Cited in
(20)- Renewal theory for asymmetric \(U\)-statistics
- Weighted dependency graphs
- Hidden words statistics for large patterns
- Stochastic analysis of minimal automata growth for generalized strings
- Central limit theorems for patterns in multiset permutations and set partitions
- Variances and covariances in the central limit theorem for the output of a transducer
- Avoiding cross-bifix-free binary words
- Toward the asymptotic count of bi-modular hidden patterns under probabilistic dynamical sources: a case study
- scientific article; zbMATH DE number 1984547 (Why is no real title available?)
- scientific article; zbMATH DE number 1754591 (Why is no real title available?)
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
- Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations
- Asymptotic normality for the size of graph tries built from M-ary tree labelings
- Local limit laws for symbol statistics in bicomponent rational models
- Maximal number of subword occurrences in a word
- Analysis of the rate functions of large deviations for symbol statistics
- Large deviation properties for pattern statistics in primitive rational models
- Maximal number of subword occurrences in a word
- Multiple pattern matching: a Markov chain approach
- \(t\)-wise independence with local dependencies
This page was built for publication: Hidden word statistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546297)