Can I read Enumerating Finitary Processes on EtoBox?

Enumerating Finitary Processes by Johnson, B. D.; Crutchfield, J. P.; Ellison, C. J.; McTague, C. S. is a scholarly article available to read on EtoBox.

What is Enumerating Finitary Processes about?

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.

Author

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

Published

2010

Language

EN