Timeline for What to do with empty set during NFA to DFA conversion?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 23, 2020 at 19:48 | comment | added | vonbrand | @DavidRicherby, I've seen it, but clearly labelled as a simplification. | |
| Nov 22, 2018 at 12:42 | comment | added | David Richerby | Of course. I'm just saying that you claim that "most" diagrams use the convention you state and my experience is the exact opposite. (In fact, I've never actually seen one in something like a textbook.) | |
| Nov 22, 2018 at 12:40 | comment | added | ratchet freak | @DavidRicherby it depends on where you get your diagrams from, and which exact definition then use for DFA. | |
| Nov 22, 2018 at 12:36 | comment | added | David Richerby | I dispute "most". All the sources I'm familiar with require a DFA to have exactly one transition from each state for each symbol in the alphabet and having that rule means that dead states must be explicit. I'm aware that some people say a DFA has at most one transition for each state/character, which does allow for an implicit dead state but I've not seen any textbook that uses this convention. | |
| Nov 22, 2018 at 12:32 | history | answered | ratchet freak | CC BY-SA 4.0 |