Minimizing finite automata is computationally hard (Q703578)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing finite automata is computationally hard |
scientific article |
Statements
Minimizing finite automata is computationally hard (English)
0 references
11 January 2005
0 references
Finite automata
0 references
Limited nondeterminism
0 references
Minimization
0 references
NP-complete
0 references
