On the Hopcroft's minimization technique for DFA and DFCA (Q1019723)
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: On the Hopcroft's minimization technique for DFA and DFCA |
scientific article; zbMATH DE number 5561690
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Hopcroft's minimization technique for DFA and DFCA |
scientific article; zbMATH DE number 5561690 |
Statements
On the Hopcroft's minimization technique for DFA and DFCA (English)
0 references
4 June 2009
0 references
cover automata
0 references
minimization
0 references
Hopcroft's algorithm
0 references
time complexity
0 references
0 references
0 references
0.9463813900947572
0 references
0.8995255827903748
0 references
0.8842331767082214
0 references
0.8796869516372681
0 references
0.8523798584938049
0 references
