OFFSET
1,2
COMMENTS
An automaton with the state set Q is synchronizing if there exists a word w such that |Qw|=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.
EXAMPLE
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].
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Marek Szykula, Oct 18 2013
STATUS
approved