Universal Tests for Memory Words

From MaRDI portal

Revision as of 23:50, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5346330

Jump to:navigation, search

DOI10.1109/TIT.2013.2268913zbMath1365.60032MaRDI QIDQ5346330

Benjamin Weiss, Gusztáv Morvai

Publication date: 8 June 2017

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

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ 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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5346330&oldid=20046736"