Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Generating Shortest Synchronizing Sequences using Answer Set Programming   For a finite state automaton, a synchronizing sequence is an input sequence
that takes all the states to the same state. Checking the existence of a
synchronizing sequence and finding a synchronizing sequence, if one exists, can
be performed in polynomial time. However, the problem of finding a shortest
synchronizing sequence is known to be NP-hard. In this work, the usefulness of
Answer Set Programming to solve this optimization problem is investigated, in
comparison with brute-force algorithms and SAT-based approaches.
  Keywords: finite automata, shortest synchronizing sequence, ASP

22
The categories of this paper are: chao-dyn
27
The categories of this paper are: comp-gas
32
The categories of this paper are: atom-ph
0
The categories of this paper are: hep-ph
10
The categories of this paper are: q-bio
8
The categories of this paper are: hep-ex
33
The categories of this paper are: plasm-ph
12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
35
The categories of this paper are: mtrl-th
30
The categories of this paper are: q-alg
14
The categories of this paper are: math-ph
5
The categories of this paper are: gr-qc
6
The categories of this paper are: astro-ph
19
The categories of this paper are: eess
11
The categories of this paper are: hep-lat