Enumerating Finitary Processes

Details Enumerating Finitary Processes Enumerating Finitary Processes

2010-10-30

arxiv.org/abs/1011.0036v2

Computer Science

Formal Languages and Automata Theory

8 pages, 3 figures, 4 tables; http://users.cse.ucdavis.edu/~cmg/compmech/pubs/efp.htm

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Enumerating Finitary Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumerating Finitary Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerating Finitary Processes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-405086