Theory of Computation : Convert NFA to DFA Example (with Epsilon)

Given a Nondeterministic Finite Automata NFA recognizing the language (01 ∪ 001 ∪ 010)^* , I will show you how to convert the NFA with epsilon transitions to an equivalent Deterministic Finite Automata DFA as a working solution with all the steps and tables in detail. In addition, I will show you how to simplify DFA.

This example was taken from the textbook Introduction to the Theory of Computation by Michael Sipser (Third Edition), from Exercise 1.17.

[goodnight]

If u are my flat teacher than for sure I am the next automata scientist.

[huanjialiang]

This video is so helpful for me to understand those material and her pronunciation is so CLEAR. Nice video!

[SirBlank]

you just saved me so much time! The fact that you also went through how to simplify a dfa!! this vid is just too good. i dont usually comment on stuff but you may have just saved me from failing my exam tomorrow as well as saving me from sleep deprivation. Thank you!

[Mydad-etel]

Hey that was a great explanation!

I would like to add that the DFA states must have transition for every "letter" in the language. Here you omit the transitions leading to the empty set, e.g. transition 1 of state 1, transition 0 of state 3 and transition 1 of state {1, 5}

[peanutbutterfalcon]

Bless your soul! You explain it more clearly than my prof!

[mgtransinc]

You explained this in a really concise way! Thank you!

[hoomanawanui]

Tysm, you explained that very short and sweet, also pretty much explained simplifying dfas as well quickly, valid video bro

[toshans]

you explanation is so simple and effective, please make more videos 😊

[kevinpatel]

Thank uh so much Ilene for educating us! It feels like it was really difficult when Prof. explain to us. But watching Youtube videos and learning is the best thing one can get!

[centrosphere]

my friend really loved this video he said it helped him so much in his exam.

[mnvxvub]

I think when you’re trying to get rid of some states cause of they lead to same states as others .
You have to make sure the no one of them is an exception state .
Thank you ❤ you helped me❤

[olfachaabouni]

I've liked your explanation which was very clear, good job. Thanks a lot from Tunisia.

[MarinersLegacy]

Best explanation I have seen of this on youtube

[hitechj]

I think I love you(Context: Finding the answer to my question lol), kidding. But in all seriousness Thank you so much. You literally just cleared up all of my confusion with how to tackle my homework. Hope you're having a blessed day.

[MattKnowsTech]

She didn't specify, but the starting state of the DFA is eps(q), where q is the starting state of the NFA. In this example, the starting state of the DFA is 1 because eps(1) = {1}, or just 1. Also, as I type this, I realize that it may not be necessary to compute eps() for the rest of the states in the NFA table.

[zoietannous]

oh my goodness. You are so smart. Can't wait to keep learning from you!

[suprecam]

Wow, thank you! I didn't even know how easy this could be with those tables.

[bread]

9:40 Thank god indeed lol, this was a very thorough and helpful walkthrough. Thank you!

[EngineerMuhammadAsif]

Wow good job 👍
You deserve one million subscribers.

[danteeep]

thanks for the video you answered the question of what to do when you have multiple nodes with multiple destinations. you just combine them into a bigger node !