[seqfan] Re: A new sequence counting the number of distinct languages recognized by DFAs

[Kevin Ryde]

Thomas Baruchel via SeqFan <seqfan at list.seqfan.eu> writes:
>
> number of distinct languages over a binary alphabet recognized by a
> DFA with n states.

A129622 might be number of minimal DFAs of n states up to equivalence,
with equivalence meaning same language accepted.  The first linked
paper has definitions.

Minimal means not equivalent to a DFA of fewer states, and I think
these are "complete" state tables so every state + symbol has a
transition to some next state, possibly a non-accepting sink.