login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A230401 Number of nonisomorphic synchronizing binary n-state automata without output under input permutations. 0

%I

%S 1,4,51,1115,34265,1318699,60477844,3210707626,193589241468,

%T 13070085476528

%N Number of nonisomorphic synchronizing binary n-state automata without output under input permutations.

%C An automaton with the state set Q is synchronizing if there exists a word w such that |Qw|=1.

%D A. Kisielewicz and M. Szykuła, Generating Small Automata and the Černý Conjecture, in Implementation and Application of Automata, volume 7982 of LNCS, pages 340-348, 2013.

%e For n=2 there are 4 such automata:

%e [0 a 0,0 b 1,1 a 0,1 b 0],

%e [0 a 0,0 b 0,1 a 0,1 b 0],

%e [0 a 0,0 b 1,1 a 0,1 b 1], and

%e [0 a 0,0 b 0,1 a 1,1 b 0].

%Y Cf. A054745, A054746, A230326.

%K nonn,hard,more

%O 1,2

%A _Marek Szykula_, Oct 18 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 27 03:03 EST 2020. Contains 332299 sequences. (Running on oeis4.)