Timeline for How this state set of DFA was retrieved from the given NFA
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 19, 2022 at 7:17 | history | edited | Russel | CC BY-SA 4.0 |
added 27 characters in body
|
| Jul 19, 2022 at 7:08 | history | edited | Russel | CC BY-SA 4.0 |
added 27 characters in body
|
| Jul 19, 2022 at 6:43 | comment | added | Russel | I checked your given source/JSON file (but you are advised not to post such details in this site since it's very similar to source code) and there seems to be a problem with it. I created your NFA from scratch and it appears that this online converter does not allow conversion of NFA with no alphabet symbol. | |
| Jul 19, 2022 at 5:24 | comment | added | sandbuzzard | However when I tried to use an online converter (joeylemon.github.io/nfa-to-dfa) (I used a JSON file, see EDIT on post), I got a different result (see edit) | |
| Jul 19, 2022 at 3:27 | comment | added | Russel | I am actually asking about the transition table of the big DFA. I think the procedure your doing already will give you the reachable states. You can check the link I give for the procedure | |
| Jul 19, 2022 at 3:19 | comment | added | sandbuzzard |
I edited the question with the transition table! So the big DFA DFA = {empty, {1}, {2}, {3}, {4}, {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4}, {1, 2, 3}, {1, 2, 4}, {1, 3, 4}, {2, 3, 4}, {1, 2, 3, 4}} is actually the DFA with states many of which are unreachable? How would I calculate only the reachable states correctly? I am not sure I am doing that correctly
|
|
| Jul 19, 2022 at 1:06 | history | answered | Russel | CC BY-SA 4.0 |