Equivalence of hidden Markov models

The hidden Markov information source (process) is a stochastic process with a finite-state Markov chain behind it, and the state cannot directly be observed, while only a function of the state is observed as a stream of symbols. This kind of process is very important in both theory and application, but its theoretical structure has not been clarified. This paper gives a sufficient condition for two hidden Markov processes based on different Markov chains to be equivalent as the stochastic process. The condition for that condition to be necessary also is shown. A condition for a hidden Markov process to be equivalent to a Markov chain also is presented.

[1]  J. W. Carlyle,et al.  Identification of State-calculable Functions of Finite Markov Chains , 1967 .

[2]  S. W. Dharmadhikari.  Exchangeable Processes which are Functions of Stationary Markov Chains , 1964 .

[3]  S. Dharmadhikari,et al.  Splitting a Single State of a Stationary Process into Markovian States , 1968 .

[4]  L. Baum,et al.  Statistical Inference for Probabilistic Functions of Finite State Markov Chains , 1966 .

[5]  D. Blackwell,et al.  On the Identifiability Problem for Functions of Finite Markov Chains , 1957 .

[6]  L. Baum,et al.  A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains , 1970 .

[7]  S. W. Dharmadhikari.  A Characterisation of a Class of Functions of Finite Markov Chains , 1965 .

[8]  L. Baum,et al.  An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process , 1972 .

[9]  L. Rabiner,et al.  An introduction to hidden Markov models , 1986, IEEE ASSP Magazine.

[10]  S. W. Dharmadhikari.  A Note on Exchangeable Processes with States of Finite Rank , 1969 .

[11]  Taylor L. Booth,et al.  Sequential machines and automata theory , 1967 .

[12]  J. Carlyle.  Reduced forms for stochastic sequential machines , 1963 .

[13]  Biing-Hwang Juang,et al.  Mixture autoregressive hidden Markov models for speech signals , 1985, IEEE Trans. Acoust. Speech Signal Process..

[14]  S. Dharmadhikari.  Functions of Finite Markov Chains , 1963 .

[15]  S. Dharmadhikari.  Sufficient Conditions for a Stationary Process to be a Function of a Finite Markov Chain , 1963 .

[16]  M. Rosenblatt,et al.  A MARKOVIAN FUNCTION OF A MARKOV CHAIN , 1958 .

[17]  E. J. Gilbert.  On the Identifiability Problem for Functions of Finite Markov Chains , 1959 .

[18]  L. Baum,et al.  An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology , 1967 .

[19]  L. R. Rabiner,et al.  On the application of vector quantization and hidden Markov models to speaker-independent, isolated word recognition , 1983, The Bell System Technical Journal.

[20]  Herman Rubin,et al.  FUNCTIONS OF PROCESSES WITH MARKOVIAN STATES-II , 1968 .

[21]  A. Heller.  On Stochastic Processes Derived From Markov Chains , 1965 .

[22]  M. G. Nadkarni,et al.  Some Regular and Non-regular Functions of Finite Markov Chains , 1970 .

[23]  L. R. Rabiner,et al.  An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition , 1983, The Bell System Technical Journal.