Order estimation of Markov chains

Gusztáv Morvai, Benjamin Weiss

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Estimators xn(Xo, X1,..., Xn), are described which, when applied to an unknown stationary process taking values from a countable alphabet X, converge almost surely to k in case the process is a kth-order Markov chain and to infinity otherwise.

Original languageEnglish
Pages (from-to)1496-1497
Number of pages2
JournalIEEE Transactions on Information Theory
Volume51
Issue number4
DOIs
Publication statusPublished - Apr 1 2005

Keywords

  • Markov chains
  • Order estimation
  • Stationary processes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Order estimation of Markov chains'. Together they form a unique fingerprint.

  • Cite this