本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2014-04-18
摘要
We consider two important time scales-the 馬可夫 and cryptic orders-that monitor how an observer synchronizes to a finitary 隨機 process. We show how to compute these orders exactly and that they are most efficiently calculated from the epsilon-machine, a process's minimal unifilar model. Surprisingly, though the 馬可夫 order is a basic concept from 隨機 process theory, it is not a probabilistic property of a process. Rather, it is a topological property and, moreover, it is not computable from any finite-state model other than the epsilon-machine. Via an exhaustive survey, we close by demonstrating that infinite 馬可夫 and infinite cryptic orders are a dominant feature in the space of finite-memory processes. We draw out the roles played in 統計 mechanical spin systems by these two complementary length
※ 此為已發表論文，全文需透過期刊付費取得