本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2024-12-17
摘要
We show how to efficiently enumerate a class of finite-memory 隨機 processes using the causal representation of & varepsilon;-machines. We characterize & varepsilon;-machines in the 語言 of automata theory and adapt a recent algorithm for generating accessible deterministic finite automata, pruning this over-large class down to that of & varepsilon;-machines. As an application, we exactly enumerate topological & varepsilon;-machines up to eight states and six-letter alphabets.
※ 此為已發表論文，全文需透過期刊付費取得