Markov approximation and consistent estimation of unbounded probabilistic suffix trees

DOI10.1007/S00574-006-0029-7zbMath1110.60092OpenAlexW2002411654WikidataQ105583380 ScholiaQ105583380MaRDI QIDQ870475

Denise Duarte, Nancy L. Garcia, Antonio Galves

Publication date: 12 March 2007

Published in: Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00574-006-0029-7

zbMATH Keywords

algorithm contextvariable length Markov chains

Mathematics Subject Classification ID

Strong limit theorems (60F15) Special processes (60K99)

Related Items (3)

Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes ⋮ Some upper bounds for the rate of convergence of penalized likelihood context tree estimators ⋮ Context tree selection: a unifying view

This page was built for publication: Markov approximation and consistent estimation of unbounded probabilistic suffix trees