Emergent Mind
Enumerating Finitary Processes
(1011.0036)
Published Oct 30, 2010
in
cs.FL
,
math.CO
,
math.DS
,
math.ST
,
nlin.CD
,
and
stat.TH
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.