Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:complexity |
O(n log n)
|
| gptkbp:field |
computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hopcroft's algorithm
|
| gptkbp:improves_on |
previous DFA minimization algorithms
|
| gptkbp:input |
gptkb:deterministic_finite_automaton
|
| gptkbp:introduced |
1971
|
| gptkbp:namedAfter |
gptkb:John_Hopcroft
|
| gptkbp:output |
minimal deterministic finite automaton
|
| gptkbp:publishedIn |
gptkb:Journal_of_Computer_and_System_Sciences
|
| gptkbp:relatedTo |
gptkb:Moore's_algorithm
partition refinement |
| gptkbp:usedFor |
minimization of deterministic finite automata
|
| gptkbp:bfsParent |
gptkb:Deterministic_Finite_Automaton
|
| gptkbp:bfsLayer |
7
|