Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Checking Whether an Automaton Is Monotonic Is NP-complete |
scientific article |
Statements
Checking Whether an Automaton Is Monotonic Is NP-complete (English)
0 references
23 September 2015
0 references
monotonic automaton
0 references
oriented automaton
0 references
complexity
0 references
NP-completeness
0 references
linear order
0 references
cyclic order
0 references
partial order
0 references
order-preserving
0 references
transition semigroup
0 references
0 references
0 references
