Conversion of NFA to DFA (Example 1)

TOC: Problem Number 1 on Conversion of Non-deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA).
Topics discussed:
This lecture shows how to convert an NFA that accepts all binary strings over (0,1) that end with '1' to its equivalent DFA using Subset Construction Method.

Music:
Axol x Alex Skrindo - You [NCS Release]

#TheoryOfComputation #TOCByNeso #NFAtoDFA #NFA #DFA #AutomataTheory

[sruthir]

You are providing service to the students, which no one can provide.

[nghtglare]

Thank you! I have my exams in a few days and was having a hard time wrapping my head around this because every other guide uses random unnecessary symbols and all. Thank you for making it so simple and to-the-point!

[itdepends]

It was very helpful. Your calm manner of your instructing is very effective.

[personguy]

My lectures and notes are a mind numbing mess of symbols. Thank you for explaining this in simple, regular language!

[ranad]

Best explanation ever.. keep going, when I encounter any difficulty, I immediately go for your videos

[lavishgarg]

Congratulations for 1M subscribers do 1m golden play button, whenever it comes, you deserve it.

[HoracioMiguelGomez]

In the transition table for DFA it seems you should not put the {...} because the image of the transition function is Q, not P(Q) for DFA. Doing that makes more intuitive why you need to create the combined state AB \in Q instead of using {A, B} \in P(Q) from the NFA.

[sathyasubrahmanyam]

This is the best lecture I've heard so far.Thank you so much sir🙏🙏🙏

[sharanyan]

Please take some complex example with states more than 4 and explain those so that we can clearly understand the concepts with such complex example since simple NFA are easier to convert to DFA than that of complex NFA

[bonedoggle]

thank you very much for having subtitles enabled. i have a lot easier of a time processing speech when i have a visual aspect to go along with it, so the subtitles help a lot. the tutorial's very clear and to the point, and i'm able to use it to get ahead on my homework early. thank you.

[mrreddy]

I could not sleep for 2 days watched 5min of this video and fell asleep... Thanks for this... nice explaination.. Thnks for my sleep 💟

[matya]

It´s correct. I have this exact example in my book. Point is NFA simply "know" when to move to the final state. Book however noted AB as B again.

[srikanthdharavath]

I have absent for this tutorial, but I have understood the concept.Tq for helping me, the best way of teaching tqsm🙏

[gedelasivakrishna]

Can there be many NFA diagrams for one question ?? If i take another type of NFA and I am getting different DFA answer ? Is it correct ??

[toufique]

How did you determine that AB is a final state?

[kushalasura]

Sir I hope your the great teacher .. thank you sir ...

[hanza]

One day before the exam here. Thank you so much for saving us(students)

[sekar]

but in the DFA we can take the state C for the null state
need reply pls

[lemonke]

6:50 why does he say "ab will be my final state" twice instead of actually explaining why it is the final state?

[yashshah]

5:37 please share that video of that union operation video.