Really i am getting so much interest in you this subject because you are teaching more mathematically and no one is teaching like this way. the things i have been finding more than 2 years now i got here. Nice sir.
Sir DFA construction to smj aa jata hai and bn bhi jata hai...but min nfa construction mai problem aa rhi hai sir....i know sir thoda weird hai ki DFA aa gya pr nfa construction nhi ayya...but it's trueeee.... Please sir I want u to make one video explaining nfa construction only.....
It can be minimized. Like in last que " starting with 'a' and ending with 'b' " if you do it as sir did than you will get minimized DFA. But instead if in NFA if you add these 2 moves which are self loops --> (q0, a) = q0 && (q2, b) = q2. then you will get one extra state in DFA which then you can delete and make the DFA minimized. So this algorithm DOES NOT guarantee that DFA will be minimized. It may or may not be.
Really i am getting so much interest in you this subject because you are teaching more mathematically and no one is teaching like this way. the things i have been finding more than 2 years now i got here. Nice sir.
Concept is crystal clear 🙏🙏
Acharya Devo Bhava 🙏
12:24 49:50
concepts clear 😍😍😍😍😍
Great Video 🤯
Sir DFA construction to smj aa jata hai and bn bhi jata hai...but min nfa construction mai problem aa rhi hai sir....i know sir thoda weird hai ki DFA aa gya pr nfa construction nhi ayya...but it's trueeee.... Please sir I want u to make one video explaining nfa construction only.....
concepts clear ....
Sir will this algorithm generate minimised DFA always or not ?
Thanku sir 😊😊
Amazing.....
NFA to DFA Q. minimized DFA always or not ?
sir just a query…booth’s algorithms still in syllabus? in digital?
nice sir🙂😊😊😘
Sir, after applying this algorithm do we get the minimized DFA or it can be minimized further?
It can be minimized if needed
It can be minimized. Like in last que " starting with 'a' and ending with 'b' " if you do it as sir did than you will get minimized DFA.
But instead if in NFA if you add these 2 moves which are self loops --> (q0, a) = q0 && (q2, b) = q2. then you will get one extra state in DFA which then you can delete and make the DFA minimized.
So this algorithm DOES NOT guarantee that DFA will be minimized. It may or may not be.
❤❤