Timeline for Why is NFA minimization a hard problem when DFA minimization is not?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 26, 2020 at 2:28 | review | First posts | |||
| Sep 3, 2020 at 4:07 | |||||
| Aug 26, 2020 at 2:23 | comment | added | user114966 | "It is shown that the resulting NFA is minimized. This means that no auxiliary states can be eliminated without violating the defining properties of Thompson NFA." "In an NFA, we call a state auxiliary if it has only $\epsilon$-transitions from other states" | |
| Aug 26, 2020 at 2:19 | history | answered | Joshua Wise | CC BY-SA 4.0 |