Equivalence of History and Generator Epsilon-Machines
Skip to main content
Open Access Publications from the University of California

Department of Mathematics

Graduate bannerUC Davis

Equivalence of History and Generator Epsilon-Machines

  • Author(s): Travers, Nicholas F.;
  • Crutchfield, James P.
  • et al.

Published Web Location

No data is associated with this publication.

Epsilon-machines are minimal, unifilar presentations of stationary stochastic processes. They were originally defined in the history machine sense, as hidden Markov models whose states are the equivalence classes of infinite pasts with the same probability distribution over futures. In analyzing synchronization, though, an alternative generator definition was given: unifilar, edge-emitting hidden Markov models with probabilistically distinct states. The key difference is that history epsilon-machines are defined by a process, whereas generator epsilon-machines define a process. We show here that these two definitions are equivalent in the finite-state case.

Item not freely available? Link broken?
Report a problem accessing this item