1. Enumerating Finitary Processes
- Author
-
Benjamin D. Johnson, James P. Crutchfield, Christopher J. Ellison, and Carl S. McTague
- Subjects
epsilon-machine ,orderly enumeration ,Science ,Astrophysics ,QB460-466 ,Physics ,QC1-999 - Abstract
We show how to efficiently enumerate a class of finite-memory stochastic processes using the causal representation of ϵ-machines. We characterize ϵ-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 ϵ-machines. As an application, we exactly enumerate topological ϵ-machines up to eight states and six-letter alphabets.
- Published
- 2024
- Full Text
- View/download PDF