Minimizing finite automata is computationally hard (Q703578)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2126133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing finite automata is computationally hard |
scientific article; zbMATH DE number 2126133 |
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
0.8768031597137451
0 references
0.8670961260795593
0 references
