历史机与发生器Epsilon机的等价性
Equivalence of History and Generator Epsilon-Machines
摘要：
ε-机是平稳随机过程的最小、单线表示。它们最初被定义为历史机器意义上的隐马尔可夫模型，其状态是无限过去的等价类，在未来具有相同的概率分布。然而，在分析同步时，给出了另一种生成器定义：具有概率不同状态的单线、边发射隐马尔可夫模型。关键的区别在于历史ε机由一个过程定义，而生成ε机定义一个过程。我们在这里表明，这两个定义是等价的有限状态的情况下。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
