Hidden word statistics

DOI10.1145/1120582.1120586zbMath1316.68111OpenAlexW2025722669MaRDI QIDQ3546297

Brigitte Vallée, Wojciech Szpankowski, Philippe Flajolet

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1120582.1120586

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Formal languages and automata (68Q45) Combinatorial probability (60C05) Analysis of variance and covariance (ANOVA) (62J10) Authentication, digital signatures and secret sharing (94A62)

Related Items (12)

Avoiding cross-bifix-free binary words ⋮ Stochastic analysis of minimal automata growth for generalized strings ⋮ Central limit theorems for patterns in multiset permutations and set partitions ⋮ 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 ⋮ Renewal theory for asymmetric \(U\)-statistics ⋮ Multiple pattern matching: a Markov chain approach ⋮ Weighted dependency graphs ⋮ \(t\)-wise independence with local dependencies ⋮ Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern ⋮ Variances and covariances in the central limit theorem for the output of a transducer

This page was built for publication: Hidden word statistics