Estimating the Lengths of Memory Words

DOI10.1109/TIT.2008.926316zbMATH Open1329.60095WikidataQ105584784 ScholiaQ105584784MaRDI QIDQ3604769

Benjamin Weiss, Gusztáv Morvai

Publication date: 24 February 2009

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

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (4)

Testing stationary processes for independence ⋮ On universal algorithms for classifying and predicting stationary processes ⋮ Countable alphabet stationary processes with at least one memory word and intermittent estimation with universal rates ⋮ Title not available (Why is that?)

This page was built for publication: Estimating the Lengths of Memory Words

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