摘要 Loosely speaking, the Shannon 熵 rate is used to g

本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。

原文連結

• SFI 頁面
• DOI

論文資訊

• 類型：已發表論文
• 日期：2017-08-30

摘要

Loosely speaking, the Shannon 熵 rate is used to gauge a 隨機 process' intrinsic randomness; the 統計 complexity gives the cost of predicting the process. We calculate, for the first time, the 熵 rate and 統計 complexity of 隨機 processes generated by finite unifilar hidden semi-馬可夫 models-memoryful, state-dependent versions of renewal processes. Calculating these quantities requires introducing novel 數學 objects (-machines of hidden semi-馬可夫 processes) and new 資訊-theoretic methods to 隨機 processes.

※ 此為已發表論文，全文需透過期刊付費取得