Checking Whether an Automaton Is Monotonic Is NP-complete

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.

DOI: 10.1007/978-3-319-22360-5_23

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@inproceedings{Szykula2015CheckingWA, title={Checking Whether an Automaton Is Monotonic Is NP-complete}, author={Marek Szykula}, booktitle={CIAA}, year={2015} }