OFFSET
1,1
COMMENTS
Topological epsilon-machines are a class of minimal, deterministic finite automata with a single recurrent component all of whose states are start and final states. These, in turn, can be represented as a class of labeled directed graphs that are strongly connected. They also represent the skeletons of finite-memory stochastic processes or sofic subshifts.
Row sums of A181621. - Jonathan Vos Post, Nov 03 2010
LINKS
B. D. Johnson, J. P. Crutchfield, C. J. Ellison and C. S. McTague, Enumerating Finitary Processes arXiv:1011.0036 [cs.FL], 2010-2012.
FORMULA
a(n) = Sum_{e=1..n+1} A181621(e,i) = Sum_{k=1..n+1} E(n;2) of binary-alphabet topological epsilon-machines with n states and k edges. - Jonathan Vos Post, Nov 03 2010
CROSSREFS
KEYWORD
hard,nonn
AUTHOR
James P. Crutchfield, Oct 30 2010
EXTENSIONS
a(8) from James P. Crutchfield, Nov 22 2010
STATUS
approved