วีดีโอ

{3,1,5} and {3,2,4} both can be the correct answers i guess.

Amazing 😀

Nice real life example of Moore Machine 👍

0:38 he is right this subject cannot be studied in 2 days, It takes 5 days !

Luv u Sir ji , Thank You

systumm hang

Sir if in the Second question b has this production rule :- B - BC | AB | SA then in 3rd step as you said to check for members of previous set only then B will not be included, But as S and A are members of step 2 so will B be included in final set or not ?

This is what the need of a student who is studying for tomorrow's Exam... Amazing !

just made it simple thanku sir

✨

very straight forward , loved it!

Sir Very Very Good Explanation Ever On TH-cam❤❤ and i am sorry but its my request to you to use a white board or any other thing for better hand writing and presentation. Once again Sorry sir🙏

can the answer be {1,3}? as 1 covers 2,4 and 3 covers 5,6,7

This is exactly what I am looking for I searched on many TH-cam channels but couldn't find as perfect as it is . Thanks a lot sir.

Bahot gnda padhata hai ye aadmi

Piss off

Understood 👍 thanks sir

Sir, at 17:56 - you have written intersection twice, is the 5) Complementation right?

sar nice explaination sar

Very useful sir ❤

construct a grammer g generating {a^n b^n c^n | n>=1} can any one?

sir you are videos are most underrated especially for a student like me from lpu

Made very easy .. thanks

sir ,you are a game changer of exams for lpu students

Sir intro sound annoying h, koi soothing sa rkho plz..

thanks sir

Stylus >>>> Blackboard

sir i am ur biggest fan😽

Thanks a lot sir

Hlo sir. Will you make playlist for placement prep. Covering all the important dsa and cp problems. With cracking tips in a interview . Or u are delivering any offline/ online course if yes, plzz tell sir i want to study from you.

If we go from q1-a->q2 and q1-b->q0 so from this we can make babab which is wrong string , check on 21:57 ,please explain me this

Construct a DFA over Σ = {a, b}. Using the definitoin of occw1(w) to mean the number of times the substring w1 appears in string w, L1 ={w∈Σ∗ :occaba(w) mod2=0} Accepted Strings: λ, a, b, ba, ababa, bbbbabaaaaabaaababa, abaaba, babababab, aabaabaabaabaa, ababbaba Anyone expert in DFA ....!

Just watched this DFA breakdown and it was 🔥! Super clear and really helped me get a grip on the concept. Thanks for making it so easy to understand-you're a lifesaver! 🙌🚀

👌

sir,why we do not include last q3 result(.ie. 1)hence our output can be 01001 instead of 0100

❤

Informative

This reads like a dystopian ad

I like this video, i was searching for so long, now i finally got it...thank you for taking the time to make this vid!!

10:54 why is this? How aa is accepted?

the BESTTT

How is this applicable in real life?… What do we use it for?

Great work ❤❤❤❤❤❤❤

Excellent ,very inspiring video, must watch

Why was the pair broken......? They may win more titles if they continue....? Any reason behind

You forgot Venus and Serena Williams!

Amazing sir

Nice video sir ji

Excellent💯

So Inspiring!!!