摘要 We propose a measure of complexity for symbolic s

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

原文連結

• SFI 頁面

論文資訊

• 類型：已發表論文
• 日期：1999

摘要

We propose a measure of complexity for symbolic sequences, which is based on conditional probabilities, and captures 計算 aspects of complexity without the explicit construction of minimal deterministic finite automata (DFA). Moreover, if the sequence is obtained from a dynamical system through a suitable encoding and its equations of motion are known, we show how to estimate the regions of phase space that correspond to 計算 states with 統計ly equivalent futures (causal states). [S1063-651X(99)11707-0].

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