A230326 Number of nonisomorphic strongly connected binary n-state automata without output under input permutations.

1, 4, 29, 460, 10701, 329794, 12310961, 538586627, 26959384899, 1518185815760

Offset: 1

Author

Marek Szykula, Oct 16 2013

Keywords

• nonn
• hard
• more

Examples

			For n=2 there are 4 such automata: [0 a 1,0 b 1,1 a 0,1 b 0], [0 a 0,0 b 1,1 a 0,1 b 0], [0 a 0,0 b 1,1 a 1,1 b 0] and [0 a 0,0 b 1,1 a 0,1 b 1].
		

References

• 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.

Crossrefs

Cf. A054745, A054746, A027835.