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. 
Marek Szyku{\l}a
cs.FL