Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Using Sat solvers for synchronization issues in partial deterministic
  automata   We approach the task of computing a carefully synchronizing word of minimum
length for a given partial deterministic automaton, encoding the problem as an
instance of SAT and invoking a SAT solver. Our experimental results demonstrate
that this approach gives satisfactory results for automata with up to 100
states even if very modest computational resources are used.

0
The categories of this paper are: hep-ph
16
The categories of this paper are: stat
32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an
37
The categories of this paper are: supr-con
35
The categories of this paper are: mtrl-th
14
The categories of this paper are: math-ph
5
The categories of this paper are: gr-qc
21
The categories of this paper are: adap-org
11
The categories of this paper are: hep-lat
27
The categories of this paper are: comp-gas
20
The categories of this paper are: acc-phys
8
The categories of this paper are: hep-ex
2
The categories of this paper are: math
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph