Timeline for Why is NFA minimization a hard problem when DFA minimization is not?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2013 at 17:41 | history | edited | Juho | CC BY-SA 3.0 | deleted 8 characters in body |
| Jun 16, 2013 at 12:47 | history | edited | Hendrik Jan | CC BY-SA 3.0 | reaction to relevant comment and alternative answer |
| Jun 15, 2013 at 21:05 | comment | added | Raphael | Neither the shortest-path nor the minimum-spanning-tree problem (always) have unique solutions, but they are still efficiently solvable. | |
| Jun 15, 2013 at 18:24 | history | answered | Hendrik Jan | CC BY-SA 3.0 |