Enumerating Finitary Processes

Author(s): Johnson, B. D.; Crutchfield, J. P.; Ellison, C. J.; McTague, C. S. | 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.

[1]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[2]  Nelma Moreira,et al.  Enumeration and generation with a string automata representation , 2007, Theor. Comput. Sci..

[3]  Cyril Nicaud,et al.  Etude du comportement en moyenne des automates finis et des langages rationnels , 2000 .

[4]  Frédérique Bassino,et al.  Enumeration and random generation of accessible automata , 2007, Theor. Comput. Sci..

[5]  Young,et al.  Inferring statistical complexity. , 1989, Physical review letters.

[6]  James P. Crutchfield,et al.  Automated pattern detection - An algorithm for constructing optimally synchronizing multi-regular language filters , 2004, Theor. Comput. Sci..

[7]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[8]  L. Rabiner,et al.  An introduction to hidden Markov models , 1986, IEEE ASSP Magazine.

[9]  Marco Almeida,et al.  Enumeration and Generation of Initially Connected Deterministic Finite Automata , 2007 .

[10]  Carl S. McTague,et al.  The organization of intrinsic computation: complexity-entropy diagrams and the diversity of natural information processing. , 2008, Chaos.

[11]  M. W. Shields An Introduction to Automata Theory , 1988 .

[12]  James P Crutchfield,et al.  Time's barbed arrow: irreversibility, crypticity, and stored information. , 2009, Physical review letters.

[13]  Jean-Marc Champarnaud,et al.  Random generation of DFAs , 2005, Theor. Comput. Sci..

[14]  Jeffrey Shallit,et al.  On the Number of Distinct Languages Accepted by Finite Automata with n States , 2002, DCFS.

[15]  Christopher C. Strelioff,et al.  Inferring Markov chains: Bayesian estimation, model comparison, entropy rate, and out-of-class modeling. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[17]  Hiroshi Narushima,et al.  Principle of Inclusion-Exclusion on Semilattices , 1974, J. Comb. Theory, Ser. A.

[18]  Robert W. Robinson Counting strongly connected finite automata , 1985 .

[19]  Robert Moran Everyone a winner. , 1997, Nursing standard (Royal College of Nursing (Great Britain) : 1987).

[20]  Neri Merhav,et al.  Hidden Markov processes , 2002, IEEE Trans. Inf. Theory.

[21]  It Informatics On-Line Encyclopedia of Integer Sequences , 2010 .

[22]  J. Crutchfield,et al.  Regularities unseen, randomness observed: levels of entropy convergence. , 2001, Chaos.