Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Experimental Study of the Shortest Reset Word of Random Automata   In this paper we describe an approach to finding the shortest reset word of a
finite synchronizing automaton by using a SAT solver. We use this approach to
perform an experimental study of the length of the shortest reset word of a
finite synchronizing automaton. The largest automata we considered had 100
states. The results of the experiments allow us to formulate a hypothesis that
the length of the shortest reset word of a random finite automaton with $n$
states and 2 input letters with high probability is sublinear with respect to
$n$ and can be estimated as $1.95 n^{0.55}.$

32
The categories of this paper are: atom-ph
15
The categories of this paper are: nucl-ex
18
The categories of this paper are: econ
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
36
The categories of this paper are: cmp-lg
16
The categories of this paper are: stat
14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph
9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
37
The categories of this paper are: supr-con
12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat