0

I have to convert this NFA to a DFA:

enter image description here

I used this technique : https://www.youtube.com/watch?v=i-fk9o46oVY to get a DFA but i would like to validate with someone who has more experience if my result is good since my result doesn't look "pretty". Also how can i confirm it's a good solution ?

I would really appreciate, thank you.

Here's my result :

enter image description here

codetime
  • 335
  • 2
  • 8
  • I see a few errors. The $a$ transition from ${1,2}$ should go to ${2,3,4}$, and the $a$ transition from ${1,2,4}$ should go to ${1,2,3,4}$. I did the conversion hastily and don’t guarantee it, but I get states ${2,3,4}$ and ${1,2,3,4}$ and don’t get ${3,4}, ${1,3,4}$ and ${1,2,3}$. – Brian M. Scott Sep 30 '20 at 22:52
  • @BrianM.Scott i edited my solution, i realized my mistake is this better ? Thanks for reply. P is the dead end – codetime Sep 30 '20 at 23:09
  • 1
    That agrees with my quick and dirty effort. – Brian M. Scott Sep 30 '20 at 23:14
  • @BrianM.Scott Nice, great thanks a lot for validating :) doing exercises without the solutions isn't always easy haha – codetime Sep 30 '20 at 23:15
  • You’re welcome. Yes, that does make it a bit harder. – Brian M. Scott Sep 30 '20 at 23:15

0 Answers0