Enumerating Finitary Processes
Author Information
Author(s): Johnson Benjamin D., Crutchfield James P., Ellison Christopher J., McTague Carl S.
Primary Institution: University of California at Davis
Hypothesis
How can we efficiently enumerate a class of finite-memory stochastic processes using the causal representation of epsilon-machines?
Conclusion
The study successfully enumerates topological epsilon-machines up to eight states and six-letter alphabets.
Supporting Evidence
- The study provides a framework for comparing different stochastic processes through measurable quantities.
- Enumerating a subclass of finite-memory stochastic processes aids in understanding their characteristics.
- The algorithm developed successfully enumerates all topological epsilon-machines.
Takeaway
This study helps us understand how many different types of processes can exist based on certain rules, like how many states they have.
Methodology
The authors adapted an algorithm for generating deterministic finite automata to enumerate topological epsilon-machines.
Limitations
The algorithm may not directly generate topological epsilon-machines without first generating a larger class of objects.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website