The Average Complexity of Moore’s State Minimization Algorithm Is O( n loglogn) (Q3586094)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Average Complexity of Moore’s State Minimization Algorithm Is O( n loglogn) |
scientific article |
Statements
The Average Complexity of Moore’s State Minimization Algorithm Is O( n loglogn) (English)
0 references
3 September 2010
0 references
