3 Simple Tricks to Construct DFA| DFA for Beginners| TOC
ฝัง
- เผยแพร่เมื่อ 12 ก.ย. 2024
- Topics covered in the video-
1) 3 Simple Tricks to Construct DFA
2) How to construct DFA for different Languages
3) Acceptance of Right Strings and Rejection of Wrong Strings
4) GATE Level Questions
For details, please watch the video till the End
Get the handwritten notes of Tricks to construct DFA
Downloading Link: drive.google.c...
Watch the complete Theory of Computation Lectures-
• Introduction to Theory...
Social Media Handles
Follow Me on Instagram: @chirag_sharma1510
Follow Me on Linkedin : / chirag-sharma-687857193
#TheoryOfComputation #AutomataTheory
For any doubts and Queries Comment Below
Kindly Like, Share and Subscribe on the Channel, Your Support is valuable in this initiative.
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! 🙌🚀
Thank you!, Keep sharing, More good content will be coming.
This is the best lecture I found on construction of DFA 🔥
Thanks very much
Best lecture on DFA ever, i appreciate it bro🎉
Glad it was helpful!
Thank you Sir for this detailed lecture, it helped a lot.
Glad it helped
Best lecture on DFA ever❤❤❤❤
Thank you
Thankyou for your explanation sir ..it makes the concept clear
You are welcome
Well Explained Great Video Sir💖🔥
@21:30, where is babbb ? why are you not counting the number of b's or a's as in previous case?
The question is to accepts strings containing aab, babb is a wrong string, So did not considered this one, babb will never go to final state
I don't really understand what's going on @12:16 coz you counted the number of symbols from state q0 -> q1 -> q0 -> q1 ->q2 and got "aaab" as string with the minimum requirement of 3 a's followed by a b. whereas, while writing the string you just counted from q1 -> q0 - >q1 -> q2 and got "aab" and is not accepted by the DFA. Is this what you did ? Please explain what's really going on here.
Doing the transition from q1 to q0 with a means we will have aaab which may be right however doing the step from q1 to q0 with a won't give us cab, So all right answers including aab is not accepted
the BESTTT
Thank you
Keep subscribing
thank you chirag , the video was helpful
Most welcome!
sir in qyes 2 we can create self loop of b as well at q2 so that we can have the string ( baabb) we can also accept this string n sir
Hi we can’t take self loop of b on q2 as it can accept abab that would mean aab is not contained in it hence we won’t apply loop of b on q2
Thank you sir 😊
Most welcome
10:54 why is this? How aa is accepted?
I said aa can't be accepted as string with ab should be accepted, aa does not contain any b so it won't be getting accepted.
❤
so you're able to have 2 final states in DFA? I thought you could only have one. seems like you have q0 and q1 as final states.
Yes we can have multiple final states in DFA but only 1 initial state in DFA, If we can have 2 answers getting accepted via different states, those will act as final states
ab wrong answer ? 7:51
Thanks for pointing out, Its fixed
is this the simple trick?
Yes soumya, Apparently this is the simplest one
This is wrong
The question was to accept string ab
Not accept strings that contain ab
Understand the difference 😂
The question is regarding string containing ab
Thank you sir🙏
Most welcome