Checking whether an automaton is monotonic is NP-complete (Q2947429)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Checking whether an automaton is monotonic is NP-complete |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7661149501800537
0 references
0.7359997034072876
0 references
0.7349306344985962
0 references
0.7245115041732788
0 references
