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.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11675669 | PMC |
| http://dx.doi.org/10.3390/e26121105 | DOI Listing |
Publication Analysis
Top Keywords
enumerating finitary
4
finitary processes
4
processes efficiently
4
efficiently enumerate
4
enumerate class
4
class finite-memory
4
finite-memory stochastic
4
stochastic processes
4
processes causal
4
causal representation
4
Similar Publications
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!