The distribution of subword counts is usually normal

DOI10.1006/eujc.1993.1030zbMath0776.68097OpenAlexW2034145759MaRDI QIDQ685313

Fred Kochman, Edward A. Bender

Publication date: 10 November 1993

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1993.1030

zbMATH Keywords

Markov chainsruns count statistics

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorics on words (68R15)

Related Items (11)

A survey of temporal data mining ⋮ Stochastic analysis of minimal automata growth for generalized strings ⋮ Successions in words and compositions ⋮ Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations ⋮ On the number of occurrences of a symbol in words of regular languages. ⋮ Multiple pattern matching: a Markov chain approach ⋮ Hidden words statistics for large patterns ⋮ Approximation of sojourn-times via maximal couplings: motif frequency distributions ⋮ A unified approach to word occurrence probabilities ⋮ Motif statistics. ⋮ Variances and covariances in the central limit theorem for the output of a transducer

This page was built for publication: The distribution of subword counts is usually normal