

A181554


The number E_{n,2} of nstate topological epsilonmachines over a binary alphabet.


0




OFFSET

1,1


COMMENTS

Topological epsilonmachines 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 finitememory stochastic processes or sofic subshifts.


LINKS



FORMULA

a(n) = Sum_{e=1..n+1} A181621(e,i) = Sum_{k=1..n+1} E(n;2) of binaryalphabet topological epsilonmachines with n states and k edges.  Jonathan Vos Post, Nov 03 2010


CROSSREFS



KEYWORD

hard,nonn


AUTHOR



EXTENSIONS



STATUS

approved



