Johnson, Benjamin D.; James P. Crutchfield; Christopher J. Ellison and Carl S. Mctague
We show how to efficiently enumerate a class of finite-memory stochastic processes using the causal representation of & varepsilon;-machines. We characterize & varepsilon;-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 & varepsilon;-machines. As an application, we exactly enumerate topological & varepsilon;-machines up to eight states and six-letter alphabets.