Enumerating Finitary Processes
Skip to main content
Open Access Publications from the University of California

Enumerating Finitary Processes

  • Author(s): Johnson, B. D.
  • Crutchfield, J. P.
  • Ellison, C. J.
  • McTague, C. S.
  • et al.

Published Web Location

No data is associated with this publication.

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.

Many UC-authored scholarly publications are freely available on this site because of the UC Academic Senate's Open Access Policy. Let us know how this access is important for you.

Item not freely available? Link broken?
Report a problem accessing this item