Conversion of NFA to DFA (Example 1)

How did you determine that AB is a final state?

wait, if state B in NFA get's 0 again, then it goes back to A right? why is it empty state?

subset contruction method

'.

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.

❤❤❤

I like how the videos are bite sized
Just chunks of 5-10 minute videos

I have a doubt I took three states for NFA..
(A)--1,0--(B)--1---((C)) (Here C is my final state )..
How to I convert it to DFA...!

Thank you. Excellent presentation.

Thank you sir😊

Why should you assign 1 to A state that returns to itself if there is 1 input leading to B state? Why A state has two inputs of 1?

Syntactically, is {AB} the same as {A∪B}?

Thank you, sir!!

I wish I could see you earlier, I found you only on my final day! 😢

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

wont AB also be the initial state ?

Hello! So when we need to design a DFA do we always first design NFA and then convert it to DFA?

Thank You sir <Happy Imogi >

Sir why should we don't put 0,1 in the final stage

Good

meeku naa hrudaya poorvaka namaskaralu guru gaaru

Why didn't we mention B transation state in the transaction table

good lecture

if something is supposed to end in 1 like the first example, it should accept something like "011111" as well as just "01" no? like the wording of these examples in almost all of these videos is so... wrong and vague at times that it makes me do it "incorrectly" based on his interpretation of the example.

it would be much more clear if he said it accepts "the set of all strings over (0, 1) that ends in ONE '1'" but he doesn't say that, it just says ending in 1, which i interpret to mean any 0*1*, or any number of 0s and 1s assuming that it still ends in 1.

also doesn't this NFA not work if it gets a string like '0101'? THAT ends in a 1, but it isn't accepted because when it gets to the 2nd 0, it goes to phi and then can't get back to the accept state. whereas the DFA WILL accept '0101'.

Very well explained. But repetitive examples again and again. It would be nicer if you have different problems.

How is AB decided as final state?

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

thank you so much

Before these videos student's grades are F, after that videos all of A s.

sweet 16😚😚

Love from Nepal sir

Happy Teachers day sir

All my college professors should be fired

Nice

bhai kitna easly samjhaya hai yaar

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

A getting input 0 will stay in A and A getting input 1 goes to B. B getting input 0 gets back to A and B getting input 1 stays in B. Can't this be done for DFA.

thank you so much

Thankyou🙏🙏🙏🙏🙏

why AB ? can't it be B ?

Big Thank U

how do we know that AB is the final state
there can be more states in the transition table

Dislikers are the teachers who don't know how to teach

cCc

if u cant directly design the DFA so first design NFA then convert it/ *SMORT*/

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

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!

Thank you!