On hidden Markov chains and finite stochastic systems
classification
🧮 math.PR
keywords
systemschainsdifferentfinitehiddenmarkovstochasticalternatively
read the original abstract
In this paper we study various properties of finite stochastic systems or hidden Markov chains as they are alternatively called. We discuss their construction following different approaches and we also derive recursive filtering formulas for the different systems that we consider. The key tool is a simple lemma on conditional expectations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.