Universal Tests for Memory Words

DOI10.1109/TIT.2013.2268913MaRDI QIDQ5346330zbMATH OpenFDO

Authors Gusztáv Morvai, Benjamin Weiss

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2013.2268913

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Markov processes: estimation; hidden Markov models (62M05) Non-Markovian processes: hypothesis testing (62M07)

Cited in

(3)

• On universal algorithms for classifying and predicting stationary processes
• scientific article; zbMATH DE number 7639721 (Why is no real title available?)
• Countable alphabet stationary processes with at least one memory word and intermittent estimation with universal rates

This page was built for publication: Universal Tests for Memory Words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346330)