why does state {2,3} with a go go {1,2,3} and not {2,3}? i mean, from state 2 with a you can go to state 3 but the e-closure of 3 doesn't go to {1,3} but only to 3, right?
The reason is we no longer have the state {1} or state {3} instead we now have one state {1,3} and if the original went to either 1 OR 3 it is going to go to this new entirely different state {1,3} that we are creating
i hav studied this example in "michael sipser" book.when he created DFA at the end , he added an empty state also and made transitions to them . so this thing is making me confuse .can u explain that empty state thing?
The automaton in the video is not actually a dfa, seeing as there is no transition for b from state 3. There has to be an empty state there for it to truly be a dfa...
just a reminder, {1,3} should also be a final state
+Bill S Truuuuuuuuuuuuuuuuuue thanks I'll put in an annotation
You said union is AND, its actually OR. Just for clarification
+Kieran Ramnarine I'll add an annotation
why does state {2,3} with a go go {1,2,3} and not {2,3}? i mean, from state 2 with a you can go to state 3 but the e-closure of 3 doesn't go to {1,3} but only to 3, right?
an empty set union set 1 will be equal to set 1, so E(0 u {1}) how come to be equal to {1,3}?
When you're in state 1, you would be able to go to state 3 with reading the epsilon. so the set should be {1,3}
you always need to look for epsilon transition of the states you reach and add those states to your set as well.
The reason is we no longer have the state {1} or state {3} instead we now have one state {1,3} and if the original went to either 1 OR 3 it is going to go to this new entirely different state {1,3} that we are creating
does anyone know why there isn't a state for 1?
state 3 doesnt have an outward arrow for b transition!!
you can make a dead state for the b transition from 3 and you can loop for the dead state.
i hav studied this example in "michael sipser" book.when he created DFA at the end , he added an empty state also and made transitions to them . so this thing is making me confuse .can u explain that empty state thing?
The automaton in the video is not actually a dfa, seeing as there is no transition for b from state 3. There has to be an empty state there for it to truly be a dfa...
@blue apple can you tell the name of book by Michael sipser ??
Great video!!! Really helps a ton!!!!
thank you you helped me a lot!!!!
thanks a lot
thank you
I think that you should add a dead state, and try to avoid saying "oops". It's extremly irritating. ;)
Please try to speak and write a bit faster. It was way too slow for such a simple example.
x1.25