arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1011.0036cs.FLmath.COmath.DSmath.STnlin.CDstat.TH
收藏

枚举有限进程

Enumerating Finitary Processes

B. D. Johnson, J. P. Crutchfield, C. J. Ellison, C. S. McTague

摘要:

我们展示了如何有效地枚举一类有限记忆随机过程的因果表示的ε机。我们表征的语言中的自动机理论和适应最近的算法生成可访问的确定性有限自动机,修剪这个过大的类的ε机。作为一个应用,我们精确地枚举拓扑ε机多达八个状态和六个字母。

英文摘要:

We show how to efficiently enumerate a class of finite-memory stochastic processes using the causal representation of epsilon-machines. We characterize epsilon-machines in the language of automata theory and adapt a recent algorithm for generating accessible deterministic finite automata, pruning this over-large class down to that of epsilon-machines. As an application, we exactly enumerate topological epsilon-machines up to eight states and six-letter alphabets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑