Skip to main content
Log in

The Realization Problem for Hidden Markov Models

  • Published:
Mathematics of Control, Signals and Systems Aims and scope Submit manuscript

Abstract.

If {X t} is a finite-state Markov process, and {Y t} is a finite-valued output process with Y t+1 depending (possibly probabilistically) on X t, then the process pair is said to constitute a hidden Markov model. This paper considers the realization question: given the probabilities of all finite-length output strings, under what circumstances and how can one construct a finite-state Markov process and a state-to-output mapping which generates an output process whose finite-length strings have the given probabilities? After reviewing known results dealing with this problem involving Hankel matrices and polyhedral cones, we develop new theory on the existence and construction of the cones in question, which effectively provides a solution to the realization problem. This theory is an extension of recent theoretical developments on the positive realization problem of linear system theory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Date received: December 13, 1996. Date revised: October 9, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anderson, B. The Realization Problem for Hidden Markov Models. Math. Control Signals Systems 12, 80–120 (1999). https://doi.org/10.1007/PL00009846

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009846

Navigation