|
%I #4 May 21 2018 10:25:04
%S 24,1028,56014,3705306,286717796,25493886852
%N Number of minimal deterministic finite automata with n states on a two-letter alphabet.
%H M. Almeida, N. Moreira, R. Reis, <a href="http://dx.doi.org/10.1016/j.tcs.2007.07.029">Enumeration and generation with a string automata representation</a>, Theor. Comp. Sci. 387 (2007) 93-102, a(7) in Section 5.
%H Frederique Bassino, Julien David and Cyril Nicaud, <a href="http://igm.univ-mlv.fr/~jdavid01/Publications.php">REGAL: a library to randomly and exhaustively generate automata.</a>.
%Y Cf. A059412, A000282.
%K nonn,more
%O 2,1
%A Johnicholas Hines (johnicholas.hines(AT)gmail.com), May 30 2007
|
