cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Marek Szykula

Marek Szykula's wiki page.

Marek Szykula has authored 2 sequences.

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

Original entry on oeis.org

1, 4, 51, 1115, 34265, 1318699, 60477844, 3210707626, 193589241468, 13070085476528
Offset: 1

Views

Author

Marek Szykula, Oct 18 2013

Keywords

Comments

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

Examples

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

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, A230326.

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

Original entry on oeis.org

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

Views

Author

Marek Szykula, Oct 16 2013

Keywords

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.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.