arXiv Open Access 2011

Equivalence of History and Generator Epsilon-Machines

Nicholas F. Travers James P. Crutchfield

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

math.PR cond-mat.stat-mech cs.IT nlin.CD stat.ML

Penulis (2)

Nicholas F. Travers

James P. Crutchfield

Format Sitasi

APA MLA BibTeX

Travers, N.F., Crutchfield, J.P. (2011). Equivalence of History and Generator Epsilon-Machines. https://arxiv.org/abs/1111.4500

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2011
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓