Checking Whether an Automaton Is Monotonic Is NP-complete
Formal Languages and Automata Theory
2015-08-11 v3
Abstract
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.
Keywords
Cite
@article{arxiv.1407.5068,
title = {Checking Whether an Automaton Is Monotonic Is NP-complete},
author = {Marek Szykuła},
journal= {arXiv preprint arXiv:1407.5068},
year = {2015}
}
Comments
13 pages, 4 figures. CIAA 2015. The final publication is available at http://link.springer.com/chapter/10.1007/978-3-319-22360-5_23