Enumerating Finitary Processes
Formal Languages and Automata Theory
2012-12-18 v3 Combinatorics
Dynamical Systems
Statistics Theory
Chaotic Dynamics
Statistics Theory
Abstract
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.
Keywords
Cite
@article{arxiv.1011.0036,
title = {Enumerating Finitary Processes},
author = {B. D. Johnson and J. P. Crutchfield and C. J. Ellison and C. S. McTague},
journal= {arXiv preprint arXiv:1011.0036},
year = {2012}
}
Comments
8 pages, 3 figures, 4 tables; http://users.cse.ucdavis.edu/~cmg/compmech/pubs/efp.htm