Related Experiment Video
Updated: Jun 3, 2025

A Web Tool for Generating High Quality Machine-readable Biological Pathways
Published on: February 8, 2017
Enumerating Finitary Processes
Benjamin D Johnson1,2, James P Crutchfield1,2,3, Christopher J Ellison1,3
1Complexity Sciences Center, University of California at Davis, One Shields Avenue, Davis, CA 95616, USA.
Abstract:
We show how to efficiently enumerate a class of finite-memory stochastic processes using the causal representation of ϵ-machines. We characterize ϵ-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 ϵ-machines. As an application, we exactly enumerate topological ϵ-machines up to eight states and six-letter alphabets.
More Related Videos
Related Concept Videos
Precipitation Processes
Energy Budgets
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Production Efficiency
Signal Flow Graphs
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...
Washing, Drying, and Ignition of Precipitates

