Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Checking Whether an Automaton Is Monotonic Is NP-complete   An automaton is monotonic if its states can be arranged in a linear order
that is preserved by the action of every letter. We prove that the problem of
deciding whether a given automaton is monotonic is NP-complete. The same result
is obtained for oriented automata, whose states can be arranged in a cyclic
order. Moreover, both problems remain hard under the restriction to binary
input alphabets.

36
The categories of this paper are: cmp-lg
13
The categories of this paper are: quant-ph
30
The categories of this paper are: q-alg
24
The categories of this paper are: dg-ga
9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
6
The categories of this paper are: astro-ph
27
The categories of this paper are: comp-gas
26
The categories of this paper are: bayes-an
4
The categories of this paper are: cond-mat
0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
3
The categories of this paper are: physics
34
The categories of this paper are: chem-ph
2
The categories of this paper are: math