Enumeration of abstract automata

One de Bruijn's combinatorial problem is extended. Mealy's finite automata are enumerated. The equivalence of automata is induced by groups active over the input alphabets and over the set of the automaton internal states.